28 #ifndef vtkKdTreePointLocator_h
29 #define vtkKdTreePointLocator_h
55 double radius,
const double x[3],
double& dist2);
66 int N,
const double x[3],
vtkIdList *result);
class to quickly locate points in 3-space
virtual void FreeSearchStructure()=0
virtual vtkIdType FindClosestPointWithinRadius(double radius, const double x[3], double &dist2)=0
concrete dataset represents vertices, lines, polygons, and triangle strips
a simple class to control print indentation
abstract class to quickly locate points in 3-space
list of point or cell ids
void PrintSelf(ostream &os, vtkIndent indent)
virtual void FindPointsWithinRadius(double R, const double x[3], vtkIdList *result)=0
virtual void FindClosestNPoints(int N, const double x[3], vtkIdList *result)=0
a Kd-tree spatial decomposition of a set of points
virtual vtkIdType FindClosestPoint(const double x[3])=0
virtual void BuildLocator()=0
virtual void GenerateRepresentation(int level, vtkPolyData *pd)=0
#define VTKCOMMONDATAMODEL_EXPORT