Go to the documentation of this file.
40 #ifndef vtkCellTreeLocator_h
41 #define vtkCellTreeLocator_h
43 #include "vtkFiltersGeneralModule.h"
47 class vtkCellPointTraversal;
71 double* weights ) VTK_OVERRIDE;
78 double& t,
double x[3],
double pcoords[3],
101 double p1[3],
double p2[3],
double tol,
double& t,
double x[3],
102 double pcoords[3],
int &subId) VTK_OVERRIDE
104 return this->Superclass::IntersectWithLine(p1, p2, tol, t, x, pcoords, subId);
114 double p1[3],
double p2[3],
double tol,
double &t,
double x[3],
115 double pcoords[3],
int &subId,
vtkIdType &cellId) VTK_OVERRIDE;
121 const double p1[3],
const double p2[3],
124 return this->Superclass::IntersectWithLine(p1, p2,
points, cellIds);
131 {
return this->Superclass::FindCell(x); }
139 virtual
void BuildLocatorInternal();
140 virtual
void BuildLocatorIfNeeded();
141 virtual
void ForceBuildLocator();
142 void BuildLocator() VTK_OVERRIDE;
155 friend class vtkCellPointTraversal;
157 friend class vtkCellTreeBuilder;
187 friend class vtkCellPointTraversal;
188 friend class vtkCellTreeBuilder;
191 void MakeNode(
unsigned int left,
unsigned int d,
float b[2] );
192 void SetChildren(
unsigned int left );
194 unsigned int GetLeftChildIndex()
const;
195 unsigned int GetRightChildIndex()
const;
196 unsigned int GetDimension()
const;
197 const float& GetLeftMaxValue()
const;
198 const float& GetRightMinValue()
const;
199 void MakeLeaf(
unsigned int start,
unsigned int size );
201 unsigned int Start()
const;
202 unsigned int Size()
const;
210 bool RayMinMaxT(const
double origin[3],
215 bool RayMinMaxT(const
double bounds[6],
216 const
double origin[3],
221 int getDominantAxis(const
double dir[3]);
224 void Classify(const
double origin[3],
235 virtual
int IntersectCellInternal(
vtkIdType cell_ID, const
double p1[3],
248 friend class vtkCellPointTraversal;
250 friend class vtkCellTreeBuilder;
represent and manipulate 3D points
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
virtual int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId)
Return intersection point (if any) of finite line with cells contained in cell locator.
Internal classes made public to allow subclasses to create customized some traversal algorithms.
std::vector< vtkCellTreeNode > Nodes
vtkIdType FindCell(double x[3]) override
reimplemented from vtkAbstractCellLocator to support bad compilers
This class is the basic building block of the cell tree.
static vtkObject * New()
Create an object with Debug turned off, modified time initialized to zero, and reference counting on.
virtual vtkIdType FindCell(double x[3])
Returns the Id of the cell containing the point, returns -1 if no cell found.
int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId) override
reimplemented from vtkAbstractCellLocator to support bad compilers
virtual void FindCellsWithinBounds(double *bbox, vtkIdList *cells)
Return a list of unique cell ids inside of a given bounding box.
a simple class to control print indentation
object to represent cell connectivity
list of point or cell ids
an abstract base class for locators which find cells
int IntersectWithLine(const double p1[3], const double p2[3], vtkPoints *points, vtkIdList *cellIds) override
reimplemented from vtkAbstractCellLocator to support bad compilers
dynamic, self-adjusting array of vtkIdType
concrete dataset represents vertices, lines, polygons, and triangle strips
provides thread-safe access to cells
std::vector< unsigned int > Leaves
This class implements the data structures, construction algorithms for fast cell location presented i...
virtual void FreeSearchStructure()=0
Free the memory required for the spatial data structure.