145 #ifndef _vtkModifiedBSPTree_h 146 #define _vtkModifiedBSPTree_h 153 class Sorted_cell_extents_Lists;
188 virtual void GenerateRepresentationLeafs(
vtkPolyData *pd);
194 double p1[3],
double p2[3],
double tol,
double&
t,
double x[3],
195 double pcoords[3],
int &subId)
196 {
return this->Superclass::IntersectWithLine(p1, p2, tol, t, x, pcoords, subId); }
203 double p1[3],
double p2[3],
double tol,
double &
t,
double x[3],
204 double pcoords[3],
int &subId,
vtkIdType &cellId);
212 double p1[3],
double p2[3],
double tol,
double &t,
double x[3],
227 const double p1[3],
const double p2[3],
229 {
return this->Superclass::IntersectWithLine(p1, p2, points, cellIds); }
240 const double p1[3],
const double p2[3],
const double tol,
248 {
return this->Superclass::FindCell(x); }
255 double pcoords[3],
double *
weights);
277 void Subdivide(
BSPNode *node, Sorted_cell_extents_Lists *lists,
vtkDataSet *dataSet,
284 virtual int IntersectCellInternal(
vtkIdType cell_ID,
const double p1[3],
const double p2[3],
285 const double tol,
double &t,
double ipt[3],
double pcoords[3],
int &subId);
288 void BuildLocatorIfNeeded();
289 void ForceBuildLocator();
290 void BuildLocatorInternal();
302 #ifndef DOXYGEN_SHOULD_SKIP_THIS 308 mChild[0] = mChild[1] = mChild[2] = NULL;
309 for (
int i=0; i<6; i++) sorted_cell_lists[i] = NULL;
314 for (
int i=0; i<3; i++)
delete mChild[i];
315 for (
int i=0; i<6; i++)
delete []sorted_cell_lists[i];
318 void setMin(
double minx,
double miny,
double minz) {
319 bounds[0] = minx; bounds[2] = miny; bounds[4] = minz;
322 void setMax(
double maxx,
double maxy,
double maxz) {
323 bounds[1] = maxx; bounds[3] = maxy; bounds[5] = maxz;
326 bool Inside(
double point[3])
const;
341 void Classify(
const double origin[3],
const double dir[3],
344 bool RayMinMaxT(
const double origin[3],
const double dir[3],
345 double &rTmin,
double &rTmax)
const;
348 friend class vtkParticleBoxTree;
351 const double bounds[6],
const double origin[3],
const double dir[3],
double &rTmin,
double &rTmax);
#define VTKFILTERSFLOWPATHS_EXPORT
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)
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
concrete dataset represents vertices, lines, polygons, and triangle strips
virtual void FreeSearchStructure()=0
#define vtkTypeMacro(thisClass, superclass)
provides thread-safe access to cells
void PrintSelf(ostream &os, vtkIndent indent)
GLint GLint GLint GLint GLint x
GLint GLint GLsizei GLsizei GLsizei depth
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
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)
GLsizei const GLfloat * points
maintain an unordered list of dataarray objects
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.