29 #ifndef vtkKdTreePointLocator_h 
   30 #define vtkKdTreePointLocator_h 
   32 #include "vtkCommonDataModelModule.h"  
   59     double radius, 
const double x[3], 
double& dist2) VTK_OVERRIDE;
 
   70     int N, 
const double x[3], 
vtkIdList *result) VTK_OVERRIDE;
 
   87   void BuildLocator() VTK_OVERRIDE;
 
   93   ~vtkKdTreePointLocator() VTK_OVERRIDE;
 
   98   vtkKdTreePointLocator(const vtkKdTreePointLocator&) VTK_DELETE_FUNCTION;
 
   99   void operator=(const vtkKdTreePointLocator&) VTK_DELETE_FUNCTION;
 
class to quickly locate points in 3-space 
 
virtual vtkIdType FindClosestPointWithinRadius(double radius, const double x[3], double &dist2)=0
Given a position x and a radius r, return the id of the point closest to the point in that radius...
 
concrete dataset represents vertices, lines, polygons, and triangle strips 
 
virtual void FreeSearchStructure()=0
Free the memory required for the spatial data structure. 
 
a simple class to control print indentation 
 
void PrintSelf(ostream &os, vtkIndent indent) override
Standard type and print methods. 
 
abstract class to quickly locate points in 3-space 
 
list of point or cell ids 
 
virtual void FindPointsWithinRadius(double R, const double x[3], vtkIdList *result)=0
Find all points within a specified radius R of position x. 
 
virtual void FindClosestNPoints(int N, const double x[3], vtkIdList *result)=0
Find the closest N points to a position. 
 
a Kd-tree spatial decomposition of a set of points 
 
virtual vtkIdType FindClosestPoint(const double x[3])=0
Given a position x, return the id of the point closest to it. 
 
static vtkObject * New()
Create an object with Debug turned off, modified time initialized to zero, and reference counting on...