VTK
vtkKdTreePointLocator.h
Go to the documentation of this file.
1 /*=========================================================================
2 
3  Program: Visualization Toolkit
4  Module: vtkKdTreePointLocator.h
5 
6  Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
7  All rights reserved.
8  See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
9 
10  This software is distributed WITHOUT ANY WARRANTY; without even
11  the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
12  PURPOSE. See the above copyright notice for more information.
13 
14 =========================================================================*/
28 #ifndef __vtkKdTreePointLocator_h
29 #define __vtkKdTreePointLocator_h
30 
32 
33 class vtkIdList;
34 class vtkKdTree;
35 
37 {
38 public:
40  static vtkKdTreePointLocator* New();
41  void PrintSelf(ostream& os, vtkIndent indent);
42 
47  virtual vtkIdType FindClosestPoint(const double x[3]);
48 
50 
54  double radius, const double x[3], double& dist2);
56 
58 
64  virtual void FindClosestNPoints(
65  int N, const double x[3], vtkIdList *result);
67 
69 
73  virtual void FindPointsWithinRadius(double R, const double x[3],
74  vtkIdList *result);
76 
78 
80  virtual void FreeSearchStructure();
81  virtual void BuildLocator();
82  virtual void GenerateRepresentation(int level, vtkPolyData *pd);
84 
85 protected:
87  virtual ~vtkKdTreePointLocator();
88 
90 
91 private:
92  vtkKdTreePointLocator(const vtkKdTreePointLocator&); // Not implemented.
93  void operator=(const vtkKdTreePointLocator&); // Not implemented.
94 };
95 
96 #endif
97 
98 
class to quickly locate points in 3-space
virtual void FreeSearchStructure()=0
virtual vtkIdType FindClosestPointWithinRadius(double radius, const double x[3], double &dist2)=0
#define VTK_FILTERING_EXPORT
int vtkIdType
Definition: vtkType.h:255
concrete dataset represents vertices, lines, polygons, and triangle strips
Definition: vtkPolyData.h:81
a simple class to control print indentation
Definition: vtkIndent.h:37
abstract class to quickly locate points in 3-space
list of point or cell ids
Definition: vtkIdList.h:34
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
Definition: vtkKdTree.h:79
virtual vtkIdType FindClosestPoint(const double x[3])=0
virtual void BuildLocator()=0
static vtkObject * New()
virtual void GenerateRepresentation(int level, vtkPolyData *pd)=0