40 #ifndef vtkStaticCellLocator_h 41 #define vtkStaticCellLocator_h 44 #include "vtkCommonDataModelModule.h" 48 struct vtkCellProcessor;
52 friend struct vtkCellBinner;
53 friend struct vtkCellProcessor;
72 vtkSetVector3Macro(Divisions,
int);
73 vtkGetVectorMacro(Divisions,
int, 3);
84 double* weights)
override;
106 const double p1[3],
const double p2[3],
double tolerance,
vtkIdList* cells)
override;
116 void FindCellsAlongPlane(
117 const double o[3],
const double n[3],
double tolerance,
vtkIdList* cells);
132 vtkIdType& cellId,
int& subId,
double& dist2)
override;
157 int IntersectWithLine(
const double a0[3],
const double a1[3],
double tol,
double& t,
double x[3],
163 int IntersectWithLine(
const double p1[3],
const double p2[3],
double tol,
double& t,
double x[3],
164 double pcoords[3],
int& subId)
override 166 return this->Superclass::IntersectWithLine(p1, p2, tol, t, x, pcoords, subId);
172 int IntersectWithLine(
const double p1[3],
const double p2[3],
double tol,
double& t,
double x[3],
173 double pcoords[3],
int& subId,
vtkIdType& cellId)
override 175 return this->Superclass::IntersectWithLine(p1, p2, tol, t, x, pcoords, subId, cellId);
184 return this->Superclass::IntersectWithLine(p1, p2,
points, cellIds);
212 vtkGetMacro(MaxNumberOfBuckets,
vtkIdType);
virtual void BuildLocator()=0
Build the locator from the input dataset.
virtual vtkIdType FindClosestPointWithinRadius(double x[3], double radius, double closestPoint[3], vtkIdType &cellId, int &subId, double &dist2)
Return the closest point within a specified radius and the cell which is closest to the point x...
virtual void FindCellsWithinBounds(double *bbox, vtkIdList *cells)
Return a list of unique cell ids inside of a given bounding box.
vtkIdType FindCell(double x[3]) override
Reimplemented from vtkAbstractCellLocator to support bad compilers.
an abstract base class for locators which find cells
int IntersectWithLine(const double p1[3], const double p2[3], vtkPoints *points, vtkIdList *cellIds) override
Reimplemented from vtkAbstractCellLocator to support bad compilers.
perform fast cell location operations
concrete dataset represents vertices, lines, polygons, and triangle strips
virtual void FreeSearchStructure()=0
Free the memory required for the spatial data structure.
unsigned char * CellHasBeenVisited
provides thread-safe access to cells
virtual void FindClosestPoint(const double x[3], double closestPoint[3], vtkIdType &cellId, int &subId, double &dist2)
Return the closest point and the cell which is closest to the point x.
int IntersectWithLine(const double p1[3], const double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId, vtkIdType &cellId) override
Reimplemented from vtkAbstractCellLocator to support bad compilers.
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
unsigned char QueryNumber
vtkCellProcessor * Processor
bool GetLargeIds()
Inform the user as to whether large ids are being used.
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
virtual void FindCellsAlongLine(const double p1[3], const double p2[3], double tolerance, vtkIdList *cells)
Given a finite line defined by the two points (p1,p2), return the list of unique cell ids in the buck...
static vtkObject * New()
Create an object with Debug turned off, modified time initialized to zero, and reference counting on...
int IntersectWithLine(const double p1[3], const double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId) override
Reimplemented from vtkAbstractCellLocator to support bad compilers.
vtkIdType MaxNumberOfBuckets
virtual void GenerateRepresentation(int level, vtkPolyData *pd)=0
Method to build a representation at a particular level.
represent and manipulate 3D points