28 #ifndef vtkHyperOctreeLimiter_h 29 #define vtkHyperOctreeLimiter_h 31 #include "vtkFiltersHyperTreeModule.h" 34 #if !defined(VTK_LEGACY_REMOVE) 47 int GetMaximumLevel();
52 void SetMaximumLevel(
int levels);
68 double MeasureCell(
int);
83 #endif // LEGACY remove
int FillOutputPortInformation(int port, vtkInformation *info) override
Fill the output port information objects for this algorithm.
A dataset structured as a tree where each node has exactly 2^n children.
virtual int RequestData(vtkInformation *, vtkInformationVector **, vtkInformationVector *)
This is called within ProcessRequest when a request asks the algorithm to do its work.
Objects that can traverse hyperoctree nodes.
Superclass for algorithms that produce output of the same type as input.
static vtkDataSetAlgorithm * New()
int FillInputPortInformation(int port, vtkInformation *info) override
Fill the input 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...