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