146 #ifndef vtkModifiedBSPTree_h 147 #define vtkModifiedBSPTree_h 149 #include "vtkFiltersFlowPathsModule.h" 153 class Sorted_cell_extents_Lists;
196 virtual void GenerateRepresentationLeafs(
vtkPolyData *pd);
202 int IntersectWithLine(
const double p1[3],
const double p2[3],
double tol,
double &t,
double x[3],
203 double pcoords[3],
int &subId,
vtkIdType &cellId)
override;
209 int IntersectWithLine(
const double p1[3],
const double p2[3],
double tol,
double &t,
double x[3],
221 const double p1[3],
const double p2[3],
const double tol,
229 double pcoords[3],
double *weights)
override;
251 void Subdivide(BSPNode *node, Sorted_cell_extents_Lists *lists,
vtkDataSet *dataSet,
258 virtual int IntersectCellInternal(
vtkIdType cell_ID,
const double p1[3],
const double p2[3],
259 const double tol,
double &t,
double ipt[3],
double pcoords[3],
int &subId);
261 void BuildLocatorIfNeeded();
262 void ForceBuildLocator();
263 void BuildLocatorInternal();
273 #ifndef DOXYGEN_SHOULD_SKIP_THIS 279 mChild[0] = mChild[1] = mChild[2] =
nullptr;
280 for (
int i=0; i<6; i++) sorted_cell_lists[i] =
nullptr;
285 for (
int i=0; i<3; i++)
delete mChild[i];
286 for (
int i=0; i<6; i++)
delete []sorted_cell_lists[i];
289 void setMin(
double minx,
double miny,
double minz) {
290 this->Bounds[0] = minx; this->Bounds[2] = miny; this->Bounds[4] = minz;
293 void setMax(
double maxx,
double maxy,
double maxz) {
294 this->Bounds[1] = maxx; this->Bounds[3] = maxy; this->Bounds[5] = maxz;
297 bool Inside(
double point[3])
const;
312 void Classify(
const double origin[3],
const double dir[3],
313 double &rDist, BSPNode *&Near, BSPNode *&Mid, BSPNode *&Far)
const;
315 bool RayMinMaxT(
const double origin[3],
const double dir[3],
316 double &rTmin,
double &rTmax)
const;
319 friend class vtkParticleBoxTree;
321 static bool VTKFILTERSFLOWPATHS_EXPORT RayMinMaxT(
322 const double bounds[6],
const double origin[3],
const double dir[3],
double &rTmin,
double &rTmax);
323 static int VTKFILTERSFLOWPATHS_EXPORT getDominantAxis(
const double dir[3]);
virtual void BuildLocator()=0
Build the locator from the input dataset.
virtual bool InsideCellBounds(double x[3], vtkIdType cell_ID)
Quickly test if a point is inside the bounds of a particular cell.
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
Free the memory required for the spatial data structure.
provides thread-safe access to cells
virtual int IntersectWithLine(const double p1[3], const 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.
a simple class to control print indentation
virtual vtkIdType FindCell(double x[3])
Returns the Id of the cell containing the point, returns -1 if no cell found.
list of point or cell ids
maintain an ordered list of IdList objects
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
static vtkObject * New()
Create an object with Debug turned off, modified time initialized to zero, and reference counting on...
virtual void GenerateRepresentation(int level, vtkPolyData *pd)=0
Method to build a representation at a particular level.
represent and manipulate 3D points
Generate axis aligned BBox tree for raycasting and other Locator based searches.