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