28 #ifndef vtkHyperOctreeLimiter_h
29 #define vtkHyperOctreeLimiter_h
31 #include "vtkFiltersHyperTreeModule.h"
46 int GetMaximumLevel();
51 void SetMaximumLevel(
int levels);
58 int FillInputPortInformation(
int port, vtkInformation *
info) VTK_OVERRIDE;
59 int FillOutputPortInformation(
int port, vtkInformation *
info) VTK_OVERRIDE;
66 void AddInteriorAttributes(vtkHyperOctreeCursor *,
int);
67 double MeasureCell(
int);
73 double SizeAtPrunePoint;
A dataset structured as a tree where each node has exactly 2^n children.
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...