27 #ifndef vtkHyperOctreeLimiter_h
28 #define vtkHyperOctreeLimiter_h
43 int GetMaximumLevel();
46 void SetMaximumLevel(
int levels);
62 double MeasureCell(
int);
virtual int FillInputPortInformation(int port, vtkInformation *info)
A dataset structured as a tree where each node has exactly 2^n children.
#define VTKFILTERSHYPERTREE_EXPORT
virtual int RequestData(vtkInformation *, vtkInformationVector **, vtkInformationVector *)
Objects that can traverse hyperoctree nodes.
Superclass for algorithms that produce output of the same type as input.
static vtkDataSetAlgorithm * New()
Limit the tree's depth, averaging data from lower level branches into the new leaves at the cut point...
virtual int FillOutputPortInformation(int port, vtkInformation *info)