Go to the documentation of this file.
29 #ifndef vtkAbstractPointLocator_h
30 #define vtkAbstractPointLocator_h
57 double radius,
const double x[3],
double& dist2) = 0;
86 virtual double *
GetBounds() {
return this->Bounds; }
virtual void GenerateRepresentation(int level, vtkPolyData *pd)=0
void FindClosestNPoints(int N, double x, double y, double z, vtkIdList *result)
virtual double * GetBounds()
virtual void FreeSearchStructure()=0
#define vtkTypeMacro(thisClass, superclass)
GLint GLint GLint GLint GLint x
vtkIdType FindClosestPoint(double x, double y, double z)
void PrintSelf(ostream &os, vtkIndent indent)
virtual void GetBounds(double *)
abstract base class for objects that accelerate spatial searches
virtual void FindPointsWithinRadius(double R, const double x[3], vtkIdList *result)=0
a simple class to control print indentation
list of point or cell ids
virtual void FindClosestNPoints(int N, const double x[3], vtkIdList *result)=0
virtual ~vtkAbstractPointLocator()
void FindPointsWithinRadius(double R, double x, double y, double z, vtkIdList *result)
GLint GLint GLint GLint GLint GLint y
vtkAbstractPointLocator()
concrete dataset represents vertices, lines, polygons, and triangle strips
abstract class to quickly locate points in 3-space
#define VTKCOMMONDATAMODEL_EXPORT
virtual vtkIdType FindClosestPoint(const double x[3])=0
virtual vtkIdType FindClosestPointWithinRadius(double radius, const double x[3], double &dist2)=0
virtual void BuildLocator()=0