163 #ifndef vtkModifiedBSPTree_h
164 #define vtkModifiedBSPTree_h
167 #include "vtkFiltersFlowPathsModule.h"
170 class Sorted_cell_extents_Lists;
202 int IntersectWithLine(
const double p1[3],
const double p2[3],
double tol,
double& t,
double x[3],
226 const double p1[3],
const double p2[3],
double tolerance,
vtkIdList* cellsIds)
override
228 this->Superclass::FindCellsAlongLine(p1, p2, tolerance, cellsIds);
239 double pcoords[3],
double* weights)
override;
251 virtual void GenerateRepresentationLeafs(
vtkPolyData* pd);
279 void Subdivide(BSPNode* node, Sorted_cell_extents_Lists* lists,
vtkDataSet* dataSet,
291 #ifndef DOXYGEN_SHOULD_SKIP_THIS
299 mChild[0] = mChild[1] = mChild[2] =
nullptr;
300 for (
int i = 0; i < 6; i++)
301 sorted_cell_lists[i] =
nullptr;
302 for (
int i = 0; i < 3; i++)
311 for (
int i = 0; i < 3; i++)
313 for (
int i = 0; i < 6; i++)
314 delete[] sorted_cell_lists[i];
317 void setMin(
double minx,
double miny,
double minz)
319 this->Bounds[0] = minx;
320 this->Bounds[2] = miny;
321 this->Bounds[4] = minz;
324 void setMax(
double maxx,
double maxy,
double maxz)
326 this->Bounds[1] = maxx;
327 this->Bounds[3] = maxy;
328 this->Bounds[5] = maxz;
331 bool Inside(
double point[3])
const;
347 void Classify(
const double origin[3],
const double dir[3],
double& rDist, BSPNode*& Near,
348 BSPNode*& Mid, BSPNode*& Far)
const;
352 static int VTKFILTERSFLOWPATHS_EXPORT getDominantAxis(
const double dir[3]);
virtual void BuildLocator()=0
Build the locator from the input dataset.
void FindCellsAlongLine(const double p1[3], const double p2[3], double tolerance, vtkIdList *cellsIds) override
Take the passed line segment and intersect it with the data set.
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 void ShallowCopy(vtkAbstractCellLocator *)
Shallow copy of a vtkAbstractCellLocator.
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 void BuildLocatorInternal()
This function is not pure virtual to maintain backwards compatibility.
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...
std::shared_ptr< BSPNode > mRoot
virtual void GenerateRepresentation(int level, vtkPolyData *pd)=0
Method to build a representation at a particular level.
represent and manipulate 3D points
virtual void ForceBuildLocator()
Build the locator from the input dataset (even if UseExistingSearchStructure is on).
Generate axis aligned BBox tree for ray-casting and other Locator based searches. ...