Go to the documentation of this file.
145 #ifndef _vtkModifiedBSPTree_h
146 #define _vtkModifiedBSPTree_h
153 class Sorted_cell_extents_Lists;
192 double p1[3],
double p2[3],
double tol,
double &
t,
double x[3],
193 double pcoords[3],
int &subId,
vtkIdType &cellId);
201 double p1[3],
double p2[3],
double tol,
double &
t,
double x[3],
213 const double p1[3],
const double p2[3],
const double tol,
221 double pcoords[3],
double *
weights);
251 const double tol,
double &
t,
double ipt[3],
double pcoords[3],
int &subId);
268 #ifndef DOXYGEN_SHOULD_SKIP_THIS
280 for (
int i=0; i<3; i++)
delete mChild[i];
284 void setMin(
double minx,
double miny,
double minz) {
288 void setMax(
double maxx,
double maxy,
double maxz) {
311 double &rTmin,
double &rTmax)
const;
317 const double bounds[6],
const double origin[3],
const double dir[3],
double &rTmin,
double &rTmax);
represent and manipulate 3D points
virtual int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId)
static bool VTKFILTERSFLOWPATHS_EXPORT RayMinMaxT(const double bounds[6], const double origin[3], const double dir[3], double &rTmin, double &rTmax)
void Subdivide(BSPNode *node, Sorted_cell_extents_Lists *lists, vtkDataSet *dataSet, vtkIdType nCells, int depth, int maxlevel, vtkIdType maxCells, int &MaxDepth)
virtual int IntersectWithLine(const double p1[3], const double p2[3], const double tol, vtkPoints *points, vtkIdList *cellIds)
virtual vtkIdType FindCell(double x[3], double tol2, vtkGenericCell *GenCell, double pcoords[3], double *weights)
void setMax(double maxx, double maxy, double maxz)
void BuildLocatorInternal()
#define vtkTypeMacro(thisClass, superclass)
virtual int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId, vtkIdType &cellId, vtkGenericCell *cell)
#define VTKFILTERSFLOWPATHS_EXPORT
bool InsideCellBounds(double x[3], vtkIdType cell_ID)
virtual vtkIdType FindCell(double x[3])
void Classify(const double origin[3], const double dir[3], double &rDist, BSPNode *&Near, BSPNode *&Mid, BSPNode *&Far) const
GLint GLint GLint GLint GLint x
virtual int IntersectCellInternal(vtkIdType cell_ID, const double p1[3], const double p2[3], const double tol, double &t, double ipt[3], double pcoords[3], int &subId)
void setMin(double minx, double miny, double minz)
vtkIdType * sorted_cell_lists[6]
GLsizei const GLfloat * points
vtkIdListCollection * GetLeafNodeCellInformation()
bool Inside(double point[3]) const
void BuildLocatorIfNeeded()
GLint GLint GLsizei GLsizei GLsizei depth
virtual void GenerateRepresentationLeafs(vtkPolyData *pd)
a simple class to control print indentation
list of point or cell ids
void PrintSelf(ostream &os, vtkIndent indent)
maintain an unordered list of dataarray objects
an abstract base class for locators which find cells
abstract class to specify dataset behavior
virtual void GenerateRepresentation(int level, vtkPolyData *pd)
static vtkModifiedBSPTree * New()
bool RayMinMaxT(const double origin[3], const double dir[3], double &rTmin, double &rTmax) const
virtual int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId, vtkIdType &cellId)
concrete dataset represents vertices, lines, polygons, and triangle strips
static int VTKFILTERSFLOWPATHS_EXPORT getDominantAxis(const double dir[3])
provides thread-safe access to cells
void FreeSearchStructure()
Generate axis aligned BBox tree for raycasting and other Locator based searches.
friend class vtkParticleBoxTree