33 #ifndef __vtkHyperTreeGridGeometry_h
34 #define __vtkHyperTreeGridGeometry_h
36 #include "vtkFiltersHyperTreeModule.h"
40 class vtkDataSetAttributes;
55 virtual int RequestData( vtkInformation*, vtkInformationVector**, vtkInformationVector* );
59 void RecursiveProcessTree(
void* );
60 void ProcessLeaf1D(
void* );
61 void ProcessLeaf2D(
void* );
62 void ProcessLeaf3D(
void* );
63 void AddFace( vtkIdType inId,
double* origin,
double* size,
64 int offset,
int orientation );
virtual int FillInputPortInformation(int port, vtkInformation *info)
virtual int RequestData(vtkInformation *request, vtkInformationVector **inputVector, vtkInformationVector *outputVector)
A dataset containing a grid of vtkHyperTree instances arranged as a rectilinear grid.
concrete dataset represents vertices, lines, polygons, and triangle strips
vtkDataSetAttributes * InData
Hyper tree grid outer surface.
static vtkPolyDataAlgorithm * New()
void PrintSelf(ostream &os, vtkIndent indent)
Superclass for algorithms that produce only polydata as output.
vtkDataSetAttributes * OutData
object to represent cell connectivity