This class implements the data structures, construction algorithms for fast cell location presented in "Fast, Memory-Efficient Cell
location in Unstructured Grids for Visualization" by Christop Garth and Kenneth I. Joy in VisWeek, 2011.
More...
#include <vtkCellTreeLocator.h>
Inherits vtkAbstractCellLocator.
|
virtual int | IsA (const char *type) |
|
vtkCellTreeLocator * | NewInstance () const |
|
void | PrintSelf (ostream &os, vtkIndent indent) |
|
virtual void | FindCellsWithinBounds (double *bbox, vtkIdList *cells) |
|
|
virtual vtkIdType | FindCell (double pos[3], double vtkNotUsed, vtkGenericCell *cell, double pcoords[3], double *weights) |
|
|
virtual int | IntersectWithLine (double a0[3], double a1[3], double tol, double &t, double x[3], double pcoords[3], int &subId, vtkIdType &cellId, vtkGenericCell *cell) |
|
|
virtual int | IntersectWithLine (double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId) |
|
|
virtual int | IntersectWithLine (double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId, vtkIdType &cellId) |
|
|
virtual int | IntersectWithLine (const double p1[3], const double p2[3], vtkPoints *points, vtkIdList *cellIds) |
|
|
virtual vtkIdType | FindCell (double x[3]) |
|
|
virtual void | FreeSearchStructure () |
|
virtual void | GenerateRepresentation (int level, vtkPolyData *pd) |
|
virtual void | BuildLocatorInternal () |
|
virtual void | BuildLocatorIfNeeded () |
|
virtual void | ForceBuildLocator () |
|
virtual void | BuildLocator () |
|
|
virtual vtkObjectBase * | NewInstanceInternal () const |
|
int | NumberOfBuckets |
|
vtkCellTree * | Tree |
|
class | vtkCellPointTraversal |
|
class | vtkCellTreeNode |
|
class | vtkCellTreeBuilder |
|
| vtkCellTreeLocator () |
|
| ~vtkCellTreeLocator () |
|
bool | RayMinMaxT (const double origin[3], const double dir[3], double &rTmin, double &rTmax) |
|
bool | RayMinMaxT (const double bounds[6], const double origin[3], const double dir[3], double &rTmin, double &rTmax) |
|
int | getDominantAxis (const double dir[3]) |
|
void | Classify (const double origin[3], const double dir[3], double &rDist, vtkCellTreeNode *&near, vtkCellTreeNode *&mid, vtkCellTreeNode *&far, int &mustCheck) |
|
virtual int | IntersectCellInternal (vtkIdType cell_ID, const double p1[3], const double p2[3], const double tol, double &t, double ipt[3], double pcoords[3], int &subId) |
|
This class implements the data structures, construction algorithms for fast cell location presented in "Fast, Memory-Efficient Cell
location in Unstructured Grids for Visualization" by Christop Garth and Kenneth I. Joy in VisWeek, 2011.
Cell Tree is a bounding interval hierarchy based data structure, where child boxes do not form an exact split of the parent boxes along a dimension. Therefore two axis- aligned bounding planes (left max and right min) are stored for each node along a dimension. This class implements the data structure (Cell Tree Node) and its build and traversal algorithms described in the paper. Some methods in building and traversing the cell tree in this class were derived avtCellLocatorBIH class in the VisIT Visualization Tool
- See Also
- vtkLocator vtkCellLocator vtkModifiedBSPTree
- Tests:
- vtkCellTreeLocator (Tests)
Definition at line 50 of file vtkCellTreeLocator.h.
vtkCellTreeLocator::vtkCellTreeLocator |
( |
| ) |
|
|
protected |
vtkCellTreeLocator::~vtkCellTreeLocator |
( |
| ) |
|
|
protected |
static int vtkCellTreeLocator::IsTypeOf |
( |
const char * |
type | ) |
|
|
static |
virtual int vtkCellTreeLocator::IsA |
( |
const char * |
type | ) |
|
|
virtual |
virtual vtkObjectBase* vtkCellTreeLocator::NewInstanceInternal |
( |
| ) |
const |
|
protectedvirtual |
void vtkCellTreeLocator::PrintSelf |
( |
ostream & |
os, |
|
|
vtkIndent |
indent |
|
) |
| |
Constructor sets the maximum number of cells in a leaf to 8 and number of buckets to 5. Buckets are used in building the cell tree as described in the paper
virtual vtkIdType vtkCellTreeLocator::FindCell |
( |
double |
pos[3], |
|
|
double |
vtkNotUsed, |
|
|
vtkGenericCell * |
cell, |
|
|
double |
pcoords[3], |
|
|
double * |
weights |
|
) |
| |
|
virtual |
Test a point to find if it is inside a cell. Returns the cellId if inside or -1 if not.
virtual int vtkCellTreeLocator::IntersectWithLine |
( |
double |
a0[3], |
|
|
double |
a1[3], |
|
|
double |
tol, |
|
|
double & |
t, |
|
|
double |
x[3], |
|
|
double |
pcoords[3], |
|
|
int & |
subId, |
|
|
vtkIdType & |
cellId, |
|
|
vtkGenericCell * |
cell |
|
) |
| |
|
virtual |
Return intersection point (if any) AND the cell which was intersected by the finite line. The cell is returned as a cell id and as a generic cell.
virtual void vtkCellTreeLocator::FindCellsWithinBounds |
( |
double * |
bbox, |
|
|
vtkIdList * |
cells |
|
) |
| |
|
virtual |
Return a list of unique cell ids inside of a given bounding box. The user must provide the vtkIdList to populate. This method returns data only after the locator has been built.
virtual int vtkCellTreeLocator::IntersectWithLine |
( |
double |
p1[3], |
|
|
double |
p2[3], |
|
|
double |
tol, |
|
|
double & |
t, |
|
|
double |
x[3], |
|
|
double |
pcoords[3], |
|
|
int & |
subId |
|
) |
| |
|
inlinevirtual |
reimplemented from vtkAbstractCellLocator to support bad compilers
Definition at line 97 of file vtkCellTreeLocator.h.
virtual int vtkCellTreeLocator::IntersectWithLine |
( |
double |
p1[3], |
|
|
double |
p2[3], |
|
|
double |
tol, |
|
|
double & |
t, |
|
|
double |
x[3], |
|
|
double |
pcoords[3], |
|
|
int & |
subId, |
|
|
vtkIdType & |
cellId |
|
) |
| |
|
virtual |
Return intersection point (if any) AND the cell which was intersected by the finite line. The cell is returned as a cell id and as a generic cell. This function is a modification from the vtkModifiedBSPTree class using the data structures in the paper to find intersections.
virtual int vtkCellTreeLocator::IntersectWithLine |
( |
const double |
p1[3], |
|
|
const double |
p2[3], |
|
|
vtkPoints * |
points, |
|
|
vtkIdList * |
cellIds |
|
) |
| |
|
inlinevirtual |
reimplemented from vtkAbstractCellLocator to support bad compilers
Definition at line 118 of file vtkCellTreeLocator.h.
virtual vtkIdType vtkCellTreeLocator::FindCell |
( |
double |
x[3] | ) |
|
|
inlinevirtual |
reimplemented from vtkAbstractCellLocator to support bad compilers
Definition at line 128 of file vtkCellTreeLocator.h.
virtual void vtkCellTreeLocator::FreeSearchStructure |
( |
| ) |
|
|
virtual |
Satisfy vtkLocator abstract interface.
virtual void vtkCellTreeLocator::GenerateRepresentation |
( |
int |
level, |
|
|
vtkPolyData * |
pd |
|
) |
| |
|
virtual |
Satisfy vtkLocator abstract interface.
virtual void vtkCellTreeLocator::BuildLocatorInternal |
( |
| ) |
|
|
virtual |
Satisfy vtkLocator abstract interface.
virtual void vtkCellTreeLocator::BuildLocatorIfNeeded |
( |
| ) |
|
|
virtual |
Satisfy vtkLocator abstract interface.
virtual void vtkCellTreeLocator::ForceBuildLocator |
( |
| ) |
|
|
virtual |
Satisfy vtkLocator abstract interface.
virtual void vtkCellTreeLocator::BuildLocator |
( |
| ) |
|
|
virtual |
Satisfy vtkLocator abstract interface.
bool vtkCellTreeLocator::RayMinMaxT |
( |
const double |
origin[3], |
|
|
const double |
dir[3], |
|
|
double & |
rTmin, |
|
|
double & |
rTmax |
|
) |
| |
|
protected |
bool vtkCellTreeLocator::RayMinMaxT |
( |
const double |
bounds[6], |
|
|
const double |
origin[3], |
|
|
const double |
dir[3], |
|
|
double & |
rTmin, |
|
|
double & |
rTmax |
|
) |
| |
|
protected |
int vtkCellTreeLocator::getDominantAxis |
( |
const double |
dir[3] | ) |
|
|
protected |
virtual int vtkCellTreeLocator::IntersectCellInternal |
( |
vtkIdType |
cell_ID, |
|
|
const double |
p1[3], |
|
|
const double |
p2[3], |
|
|
const double |
tol, |
|
|
double & |
t, |
|
|
double |
ipt[3], |
|
|
double |
pcoords[3], |
|
|
int & |
subId |
|
) |
| |
|
protectedvirtual |
friend class vtkCellPointTraversal |
|
friend |
friend class vtkCellTreeBuilder |
|
friend |
int vtkCellTreeLocator::NumberOfBuckets |
|
protected |
The documentation for this class was generated from the following file: