44 #ifndef vtkCellLocator_h 45 #define vtkCellLocator_h 47 #include "vtkCommonDataModelModule.h" 50 class vtkNeighborCells;
84 double& t,
double x[3],
double pcoords[3],
100 double x[3],
double closestPoint[3],
102 int &subId,
double& dist2)
override;
122 double x[3],
double radius,
double closestPoint[3],
124 int &subId,
double& dist2,
int &inside)
override;
135 virtual int GetNumberOfBuckets(
void);
144 double pcoords[3],
double *weights)
override;
161 double tolerance,
vtkIdList *cells)
override;
169 virtual void BuildLocatorIfNeeded();
170 virtual void ForceBuildLocator();
171 virtual void BuildLocatorInternal();
179 void GetBucketNeighbors(
int ijk[3],
int ndivs,
int level);
180 void GetOverlappingBuckets(
double x[3],
int ijk[3],
double dist,
181 int prevMinLevel[3],
int prevMaxLevel[3]);
183 void ClearCellHasBeenVisited();
184 void ClearCellHasBeenVisited(
int id);
186 double Distance2ToBucket(
double x[3],
int nei[3]);
187 double Distance2ToBounds(
double x[3],
double bounds[6]);
196 void MarkParents(
void*,
int,
int,
int,
int,
int);
197 void GetChildren(
int idx,
int level,
int children[8]);
198 int GenerateIndex(
int offset,
int numDivs,
int i,
int j,
int k,
200 void GenerateFace(
int face,
int numDivs,
int i,
int j,
int k,
207 void ComputeOctantBounds(
int i,
int j,
int k);
208 double OctantBounds[6];
211 if ( this->OctantBounds[0]-tol <= x[0] && x[0] <= this->OctantBounds[1]+tol &&
212 this->OctantBounds[2]-tol <= x[1] && x[1] <= this->OctantBounds[3]+tol &&
213 this->OctantBounds[4]-tol <= x[2] && x[2] <= this->OctantBounds[5]+tol )
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 FindClosestPoint(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.
virtual void FindCellsAlongLine(double p1[3], 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...
virtual void FindCellsWithinBounds(double *bbox, vtkIdList *cells)
Return a list of unique cell ids inside of a given bounding box.
vtkNeighborCells * Buckets
virtual void SetNumberOfCellsPerNode(int)
Specify the preferred/maximum number of cells in each node/bucket.
an abstract base class for locators which find cells
int GetNumberOfCellsPerBucket()
void SetNumberOfCellsPerBucket(int N)
Specify the average number of cells in each octant.
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
unsigned char * CellHasBeenVisited
octree-based spatial search object to quickly locate cells
int IsInOctantBounds(double x[3], double tol=0.0)
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
virtual int IntersectWithLine(double p1[3], 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.
object to represent cell connectivity
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