VTK  9.1.0
vtkCellLocator.h
Go to the documentation of this file.
1/*=========================================================================
2
3 Program: Visualization Toolkit
4 Module: vtkCellLocator.h
5
6 Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
7 All rights reserved.
8 See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
9
10 This software is distributed WITHOUT ANY WARRANTY; without even
11 the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
12 PURPOSE. See the above copyright notice for more information.
13
14=========================================================================*/
141#ifndef vtkCellLocator_h
142#define vtkCellLocator_h
143
145#include "vtkCommonDataModelModule.h" // For export macro
146
147class vtkNeighborCells;
148
149class VTKCOMMONDATAMODEL_EXPORT vtkCellLocator : public vtkAbstractCellLocator
150{
151public:
153 void PrintSelf(ostream& os, vtkIndent indent) override;
154
160
166
167 // Re-use any superclass signatures that we don't override.
172
180 int IntersectWithLine(const double a0[3], const double a1[3], double tol, double& t, double x[3],
181 double pcoords[3], int& subId, vtkIdType& cellId, vtkGenericCell* cell) override;
182
195 void FindClosestPoint(const double x[3], double closestPoint[3], vtkGenericCell* cell,
196 vtkIdType& cellId, int& subId, double& dist2) override;
197
216 vtkIdType FindClosestPointWithinRadius(double x[3], double radius, double closestPoint[3],
217 vtkGenericCell* cell, vtkIdType& cellId, int& subId, double& dist2, int& inside) override;
218
222 virtual vtkIdList* GetCells(int bucket);
223
228 virtual int GetNumberOfBuckets(void);
229
236 double x[3], double tol2, vtkGenericCell* GenCell, double pcoords[3], double* weights) override;
237
243 void FindCellsWithinBounds(double* bbox, vtkIdList* cells) override;
244
254 const double p1[3], const double p2[3], double tolerance, vtkIdList* cells) override;
255
257
260 void FreeSearchStructure() override;
261 void BuildLocator() override;
262 virtual void BuildLocatorIfNeeded();
263 virtual void ForceBuildLocator();
264 virtual void BuildLocatorInternal();
265 void GenerateRepresentation(int level, vtkPolyData* pd) override;
267
268protected:
270 ~vtkCellLocator() override;
271
272 void GetBucketNeighbors(int ijk[3], int ndivs, int level);
274 const double x[3], int ijk[3], double dist, int prevMinLevel[3], int prevMaxLevel[3]);
275
278
279 double Distance2ToBucket(const double x[3], int nei[3]);
280 double Distance2ToBounds(const double x[3], double bounds[6]);
281
282 int NumberOfOctants; // number of octants in tree
283 double Bounds[6]; // bounding box root octant
284 int NumberOfParents; // number of parent octants
285 double H[3]; // width of leaf octant in x-y-z directions
286 int NumberOfDivisions; // number of "leaf" octant sub-divisions
287 vtkIdList** Tree; // octree
288
289 void MarkParents(void*, int, int, int, int, int);
290 void GetChildren(int idx, int level, int children[8]);
291 int GenerateIndex(int offset, int numDivs, int i, int j, int k, vtkIdType& idx);
293 int face, int numDivs, int i, int j, int k, vtkPoints* pts, vtkCellArray* polys);
294
295 vtkNeighborCells* Buckets;
296 unsigned char* CellHasBeenVisited;
297 unsigned char QueryNumber;
298
299 void ComputeOctantBounds(int i, int j, int k);
300 double OctantBounds[6]; // the bounds of the current octant
301 int IsInOctantBounds(const double x[3], double tol = 0.0)
302 {
303 if (this->OctantBounds[0] - tol <= x[0] && x[0] <= this->OctantBounds[1] + tol &&
304 this->OctantBounds[2] - tol <= x[1] && x[1] <= this->OctantBounds[3] + tol &&
305 this->OctantBounds[4] - tol <= x[2] && x[2] <= this->OctantBounds[5] + tol)
306 {
307 return 1;
308 }
309 else
310 {
311 return 0;
312 }
313 }
314
315private:
316 vtkCellLocator(const vtkCellLocator&) = delete;
317 void operator=(const vtkCellLocator&) = delete;
318};
319
320#endif
an abstract base class for locators which find cells
virtual vtkIdType FindCell(double x[3])
Returns the Id of the cell containing the point, returns -1 if no cell found.
virtual void SetNumberOfCellsPerNode(int)
Specify the preferred/maximum number of cells in each node/bucket.
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.
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 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.
object to represent cell connectivity
Definition: vtkCellArray.h:290
octree-based spatial search object to quickly locate cells
virtual vtkIdList * GetCells(int bucket)
Get the cells in a particular bucket.
void FreeSearchStructure() override
Satisfy vtkLocator abstract interface.
static vtkCellLocator * New()
Construct with automatic computation of divisions, averaging 25 cells per bucket.
~vtkCellLocator() override
double Distance2ToBounds(const double x[3], double bounds[6])
void ClearCellHasBeenVisited()
int GenerateIndex(int offset, int numDivs, int i, int j, int k, vtkIdType &idx)
int GetNumberOfCellsPerBucket()
int IntersectWithLine(const double a0[3], const double a1[3], double tol, double &t, double x[3], double pcoords[3], int &subId, vtkIdType &cellId, vtkGenericCell *cell) override
Return intersection point (if any) AND the cell which was intersected by the finite line.
vtkNeighborCells * Buckets
void GenerateRepresentation(int level, vtkPolyData *pd) override
Satisfy vtkLocator abstract interface.
unsigned char QueryNumber
virtual int GetNumberOfBuckets(void)
Return number of buckets available.
void FindCellsAlongLine(const double p1[3], const double p2[3], double tolerance, vtkIdList *cells) override
Given a finite line defined by the two points (p1,p2), return the list of unique cell ids in the buck...
virtual void BuildLocatorInternal()
Satisfy vtkLocator abstract interface.
void GetOverlappingBuckets(const double x[3], int ijk[3], double dist, int prevMinLevel[3], int prevMaxLevel[3])
void SetNumberOfCellsPerBucket(int N)
Specify the average number of cells in each octant.
void FindCellsWithinBounds(double *bbox, vtkIdList *cells) override
Return a list of unique cell ids inside of a given bounding box.
vtkIdType FindCell(double x[3], double tol2, vtkGenericCell *GenCell, double pcoords[3], double *weights) override
Find the cell containing a given point.
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
vtkIdList ** Tree
void GetChildren(int idx, int level, int children[8])
void MarkParents(void *, int, int, int, int, int)
double Distance2ToBucket(const double x[3], int nei[3])
void ComputeOctantBounds(int i, int j, int k)
void GenerateFace(int face, int numDivs, int i, int j, int k, vtkPoints *pts, vtkCellArray *polys)
virtual void ForceBuildLocator()
Satisfy vtkLocator abstract interface.
void ClearCellHasBeenVisited(vtkIdType id)
void GetBucketNeighbors(int ijk[3], int ndivs, int level)
vtkIdType FindClosestPointWithinRadius(double x[3], double radius, double closestPoint[3], vtkGenericCell *cell, vtkIdType &cellId, int &subId, double &dist2, int &inside) override
Return the closest point within a specified radius and the cell which is closest to the point x.
int IsInOctantBounds(const double x[3], double tol=0.0)
void BuildLocator() override
Satisfy vtkLocator abstract interface.
void FindClosestPoint(const double x[3], double closestPoint[3], vtkGenericCell *cell, vtkIdType &cellId, int &subId, double &dist2) override
Return the closest point and the cell which is closest to the point x.
virtual void BuildLocatorIfNeeded()
Satisfy vtkLocator abstract interface.
unsigned char * CellHasBeenVisited
provides thread-safe access to cells
list of point or cell ids
Definition: vtkIdList.h:140
a simple class to control print indentation
Definition: vtkIndent.h:113
represent and manipulate 3D points
Definition: vtkPoints.h:143
concrete dataset represents vertices, lines, polygons, and triangle strips
Definition: vtkPolyData.h:195
int vtkIdType
Definition: vtkType.h:332