Go to the documentation of this file.
28 #ifndef vtkHyperOctreeLimiter_h
29 #define vtkHyperOctreeLimiter_h
31 #include "vtkFiltersHyperTreeModule.h"
46 int GetMaximumLevel();
51 void SetMaximumLevel(
int levels);
67 double MeasureCell(
int);
Objects that can traverse hyperoctree nodes.
virtual int RequestData(vtkInformation *, vtkInformationVector **, vtkInformationVector *)
This is called within ProcessRequest when a request asks the algorithm to do its work.
Superclass for algorithms that produce output of the same type as input.
int FillInputPortInformation(int port, vtkInformation *info) override
Fill the input port information objects for this algorithm.
static vtkDataSetAlgorithm * New()
int FillOutputPortInformation(int port, vtkInformation *info) override
Fill the output port information objects for this algorithm.
Limit the tree's depth, averaging data from lower level branches into the new leaves at the cut point...
A dataset structured as a tree where each node has exactly 2^n children.