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