145 #ifndef _vtkModifiedBSPTree_h
146 #define _vtkModifiedBSPTree_h
152 class Sorted_cell_extents_Lists;
187 virtual void GenerateRepresentationLeafs(
vtkPolyData *pd);
193 double p1[3],
double p2[3],
double tol,
double& t,
double x[3],
194 double pcoords[3],
int &subId)
195 {
return this->Superclass::IntersectWithLine(p1, p2, tol, t, x, pcoords, subId); }
202 double p1[3],
double p2[3],
double tol,
double &t,
double x[3],
203 double pcoords[3],
int &subId,
vtkIdType &cellId);
211 double p1[3],
double p2[3],
double tol,
double &t,
double x[3],
226 const double p1[3],
const double p2[3],
228 {
return this->Superclass::IntersectWithLine(p1, p2, points, cellIds); }
239 const double p1[3],
const double p2[3],
const double tol,
247 {
return this->Superclass::FindCell(x); }
254 double pcoords[3],
double *weights);
276 void Subdivide(
BSPNode *node, Sorted_cell_extents_Lists *lists,
vtkDataSet *dataSet,
283 virtual int IntersectCellInternal(
vtkIdType cell_ID,
const double p1[3],
const double p2[3],
284 const double tol,
double &t,
double ipt[3],
double pcoords[3],
int &subId);
287 void BuildLocatorIfNeeded();
288 void ForceBuildLocator();
289 void BuildLocatorInternal();
301 #ifndef DOXYGEN_SHOULD_SKIP_THIS
313 for (
int i=0; i<3; i++)
if (
mChild[i])
delete mChild[i];
317 void setMin(
double minx,
double miny,
double minz) {
321 void setMax(
double maxx,
double maxy,
double maxz) {
340 void Classify(
const double origin[3],
const double dir[3],
344 double &rTmin,
double &rTmax)
const;
350 const double bounds[6],
const double origin[3],
const double dir[3],
double &rTmin,
double &rTmax);
virtual void BuildLocator()=0
virtual vtkIdType FindClosestPointWithinRadius(double x[3], double radius, double closestPoint[3], vtkIdType &cellId, int &subId, double &dist2)
virtual void FindClosestPoint(double x[3], double closestPoint[3], vtkIdType &cellId, int &subId, double &dist2)
virtual int IntersectWithLine(const double p1[3], const double p2[3], vtkPoints *points, vtkIdList *cellIds)
bool Inside(double point[3]) const
virtual vtkIdType FindCell(double x[3])
virtual bool InsideCellBounds(double x[3], vtkIdType cell_ID)
abstract class to specify dataset behavior
an abstract base class for locators which find cells
void Classify(const double origin[3], const double dir[3], double &rDist, BSPNode *&Near, BSPNode *&Mid, BSPNode *&Far) const
concrete dataset represents vertices, lines, polygons, and triangle strips
virtual void FreeSearchStructure()=0
provides thread-safe access to cells
bool RayMinMaxT(const double origin[3], const double dir[3], double &rTmin, double &rTmax) const
void PrintSelf(ostream &os, vtkIndent indent)
void setMax(double maxx, double maxy, double maxz)
a simple class to control print indentation
virtual int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId)
virtual vtkIdType FindCell(double x[3])
list of point or cell ids
friend class vtkParticleBoxTree
void setMin(double minx, double miny, double minz)
virtual int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId)
maintain an unordered list of dataarray objects
vtkIdType * sorted_cell_lists[6]
static int VTK_GRAPHICS_EXPORT getDominantAxis(const double dir[3])
virtual void GenerateRepresentation(int level, vtkPolyData *pd)=0
represent and manipulate 3D points
Generate axis aligned BBox tree for raycasting and other Locator based searches.