Go to the documentation of this file.
46 #ifndef vtkHyperTreeGrid_h
47 #define vtkHyperTreeGrid_h
94 void SetGridSize(
unsigned int i,
unsigned int j,
unsigned int k );
112 { this->SetTransposedRootIndexing(
false ); }
114 { this->SetTransposedRootIndexing(
true ); }
265 double tol2,
int& subId,
double pcoords[3],
277 double tol2,
int& subId,
double pcoords[3],
330 unsigned int childIdx );
363 unsigned int GridSize[3];
381 std::map<vtkIdType, double> PointShifts[3];
388 #if !defined(__WRAP__) && !defined(__WRAP_GCCXML__)
428 double* origin,
double*
size);
454 unsigned short Level;
475 std::map<vtkIdType, vtkHyperTree*>::iterator
Iterator;
494 return this->Cursors + this->MiddleCursorId + idx;
represent and manipulate 3D points
unsigned long GetActualMemorySize()
vtkIdType GetGlobalNodeIndex()
void EvaluateDualCorner(vtkHyperTreeSimpleCursor *)
#define vtkGetObjectMacro(name, type)
unsigned int BranchFactor
vtkDataArray * ZCoordinates
vtkIdTypeArray * GetConnectivity()
bool TransposedRootIndexing
vtkIdType GetNumberOfLevels(vtkIdType)
vtkIdTypeArray * Connectivity
vtkHyperTree * GetNextTree()
void SetDimension(unsigned int)
virtual int GetCellType(vtkIdType)
static vtkInformationIntegerKey * LEVELS()
represent and manipulate attribute data in a dataset
vtkHyperTreeSimpleCursor()
std::map< vtkIdType, double > ReductionFactors
#define vtkTypeMacro(thisClass, superclass)
GLint GLint GLint GLint GLint x
void Initialize(vtkHyperTreeGrid *, vtkIdType, int[3])
void SetBranchFactor(unsigned int)
void SetIndexingModeToKJI()
abstract superclass for arrays of numeric data
unsigned short GetLevel()
void SetMaterialMask(vtkBitArray *)
vtkBitArray * MaterialMask
virtual double * GetPoint(vtkIdType)
void PrintSelf(ostream &, vtkIndent)
void TraverseDualLeaf(vtkHyperTreeGridSuperCursor *)
cell represents a 1D line
std::map< vtkIdType, vtkHyperTree * >::iterator Iterator
virtual vtkIdType FindCell(double x[3], vtkCell *cell, vtkGenericCell *gencell, vtkIdType cellId, double tol2, int &subId, double pcoords[3], double *weights)
void InitializeSuperCursor(vtkHyperTreeGridSuperCursor *, vtkIdType)
unsigned int NumberOfChildren
virtual void GetPointCells(vtkIdType, vtkIdList *)
void SetGridSize(unsigned int i, unsigned int j, unsigned int k)
void GetCell(vtkIdType, vtkCell *)
void GetLevelZeroCoordsFromIndex(vtkIdType index, unsigned int &i, unsigned int &j, unsigned int &k)
vtkIdType GetNumberOfLeaves()
void TraverseDualRecursively(vtkHyperTreeGridSuperCursor *, unsigned int)
create and manipulate unsorted lists of objects
#define vtkGetVector3Macro(name, type)
virtual void GetPoint(vtkIdType, double[3])
void SetYCoordinates(vtkDataArray *)
virtual void GetCell(vtkIdType, vtkGenericCell *)
vtkDataArray * XCoordinates
abstract class to specify cell behavior
Objects that can traverse hypertree nodes.
std::map< vtkIdType, vtkHyperTree * > HyperTrees
void Initialize(vtkHyperTreeGrid *)
void SetGridExtent(int iMin, int iMax, int jMin, int jMax, int kMin, int kMax)
void SetZCoordinates(vtkDataArray *)
a simple class to control print indentation
object represents upward pointers from points to list of cells using each point
void SetGridExtent(int extent[6])
list of point or cell ids
void SetGridSize(unsigned int[3])
vtkIdType GetNumberOfTrees()
void InitializeSuperCursorChild(vtkHyperTreeGridSuperCursor *parent, vtkHyperTreeGridSuperCursor *child, unsigned int childIdx)
An object structured as a tree where each node has exactly either 2^n or 3^n children.
vtkHyperTreeCursor * NewCursor(vtkIdType)
void DeepCopy(vtkDataObject *)
#define vtkGetMacro(name, type)
void SetXCoordinates(vtkDataArray *)
void CopyStructure(vtkDataSet *)
vtkIdType RecursiveFindPoint(double x[3], vtkHyperTreeSimpleCursor *cursor, double *origin, double *size)
virtual void GetCellPoints(vtkIdType, vtkIdType &, vtkIdType *&)
abstract class to specify dataset behavior
vtkSetMacro(IgnoreDriverBugs, bool)
void ShallowCopy(vtkDataObject *)
vtkHyperTree * GetNextTree(vtkIdType &index)
dynamic, self-adjusting array of vtkIdType
virtual void SetMaterialMaskIndex(vtkIdTypeArray *)
vtkIdType GetNumberOfPoints()
a cell that represents an orthogonal quadrilateral
vtkIdTypeArray * MaterialMaskIndex
virtual void GetCellPoints(vtkIdType, vtkIdList *)
provides thread-safe access to cells
void DeleteInternalArrays()
static vtkHyperTreeGrid * New()
void SubdivideLeaf(vtkHyperTreeCursor *, vtkIdType)
static vtkInformationIntegerKey * DIMENSION()
void GenerateSuperCursorTraversalTable()
dynamic, self-adjusting array of bits
vtkHyperTreeSimpleCursor * GetCursor(int idx)
#define VTKCOMMONDATAMODEL_EXPORT
void InitializeTreeIterator(vtkHyperTreeIterator &)
virtual vtkCell * GetCell(vtkIdType)
general representation of visualization data
static vtkInformationDoubleVectorKey * SIZES()
void InitializeSuperCursor(vtkHyperTreeGridSuperCursor *, unsigned int, unsigned int, unsigned int, vtkIdType)
vtkDataArray * YCoordinates
vtkIdType GetNumberOfCells()
virtual vtkIdType FindCell(double x[3], vtkCell *cell, vtkIdType cellId, double tol2, int &subId, double pcoords[3], double *weights)
virtual int GetMaxCellSize()
virtual vtkIdType FindPoint(double x[3])
std::map< vtkIdType, bool > PointShifted
void TraverseDualMaskedLeaf(vtkHyperTreeGridSuperCursor *)
A dataset containing a grid of vtkHyperTree instances arranged as a rectilinear grid.
void SetIndexingModeToIJK()
virtual void GetCellNeighbors(vtkIdType, vtkIdList *, vtkIdList *)
virtual void GenerateTrees()
a cell that represents a 3D orthogonal parallelepiped