Go to the documentation of this file.
62 #ifndef vtkClipHyperOctree_h
63 #define vtkClipHyperOctree_h
represent and manipulate 3D points
#define vtkGetObjectMacro(name, type)
represent and manipulate point attribute data
vtkUnstructuredGrid * Output
void SetLocator(vtkIncrementalPointLocator *locator)
a cell that represents an n-sided polygon
vtkClipHyperOctree(vtkImplicitFunction *cf=NULL)
void CreateDefaultLocator()
static vtkClipHyperOctree * New()
vtkIncrementalPointLocator * Locator
dynamic, self-adjusting array of unsigned char
virtual void SetClipFunction(vtkImplicitFunction *)
#define vtkTypeMacro(thisClass, superclass)
Objects that can traverse hyperoctree nodes.
vtkDoubleArray * TetScalars
vtkUnstructuredGrid * ClippedOutput
vtkUnstructuredGrid * GetClippedOutput()
vtkHyperOctreeCursor * Sibling
void ClipNode(vtkHyperOctreeCursor *cursor, int level, double bounds[6])
virtual int RequestData(vtkInformation *, vtkInformationVector **, vtkInformationVector *)
virtual int FillInputPortInformation(int port, vtkInformation *info)
A concrete implementation of vtkHyperOctreePointsGrabber used by vtkClipHyperOctree and vtkHyperOctre...
helper class to generate triangulations
vtkIncrementalPointLocator * Locator2
abstract interface for implicit functions
#define VTKFILTERSHYPERTREE_EXPORT
vtkHyperOctreeClipCutPointsGrabber * Grabber
vtkIdType TemplateCounter
represent and manipulate cell attribute data
vtkImplicitFunction * ClipFunction
a simple class to control print indentation
object to represent cell connectivity
int GenerateClippedOutput
Abstract class in support of both point location and point insertion.
void PrintSelf(ostream &os, vtkIndent indent)
#define vtkGetMacro(name, type)
vtkOrderedTriangulator * Triangulator
vtkBooleanMacro(IgnoreDriverBugs, bool)
vtkSetMacro(IgnoreDriverBugs, bool)
dynamic, self-adjusting array of vtkIdType
vtkDoubleArray * CellScalars
Superclass for algorithms that produce only unstructured grid as output.
dynamic, self-adjusting array of double
dataset represents arbitrary combinations of all possible cell types
A dataset structured as a tree where each node has exactly 2^n children.
a 3D cell that represents a tetrahedron
clip an hyperoctree with user-specified implicit function or input scalar data