32 #ifndef vtkAbstractPointLocator_h 
   33 #define vtkAbstractPointLocator_h 
   54   virtual vtkIdType FindClosestPoint(
const double x[3]) = 0;
 
   55   vtkIdType FindClosestPoint(
double x, 
double y, 
double z);
 
   62   virtual vtkIdType FindClosestPointWithinRadius(
 
   63     double radius, 
const double x[3], 
double& dist2) = 0;
 
   73   virtual void FindClosestNPoints(
 
   74     int N, 
const double x[3], 
vtkIdList *result) = 0;
 
   75   void FindClosestNPoints(
int N, 
double x, 
double y, 
double z,
 
   84   virtual void FindPointsWithinRadius(
double R, 
const double x[3],
 
   86   void FindPointsWithinRadius(
double R, 
double x, 
double y, 
double z,
 
   92   virtual double *
GetBounds() { 
return this->Bounds; }
 
   93   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)
vtkIdType NumberOfBuckets
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