#include <mitkKdTreePointSet.h>
Inherits mitkPointSet.
Inheritance diagram for mitkKdTreePointSet:


Public Member Functions | |
| mitkKdTreePointSet () | |
| virtual | ~mitkKdTreePointSet () | 
| mitkKdTreePointSet (mitkPointSet *pointSet) | |
| virtual void | Initialize () | 
| virtual void | GetNearestPoint (double *query_point, double *result_point, int &i) | 
| virtual void | GetKNearestPoints (double *query_point, unsigned int k, vector< int > &indices) | 
| virtual void | GetKNearestPoints (vector< double > *query_point, unsigned int k, vector< int > &indices) | 
| virtual void | GetNearestPoints (mitkPointSet *query_pointset, vector< int > &indices) | 
| virtual void | GetPointsInBoundingBox (mitkBoundingBox< double > &box, vector< int > &indices) | 
| virtual void | GetPointsInRadius (double *query_point, double radius, vector< int > &indices) | 
mitkKdTreePointSet is a class to represent geometry in the form of a set of points in two or three dimensional space using k-d tree data structure. A fast k nearest neighbor point searching is supported in this class.
      
  | 
  
| 
 Constructor.  | 
  
      
  | 
  
| 
 De-constructor.  | 
  
      
  | 
  
| 
 Constructor initialized with a point set. 
  | 
  
      
  | 
  ||||||||||||||||
| 
 Get k nearest points to the query point. 
 Reimplemented from mitkPointSet.  | 
  
      
  | 
  ||||||||||||||||
| 
 Get k nearest point to the query point. 
 Reimplemented from mitkPointSet.  | 
  
      
  | 
  ||||||||||||||||
| 
 Get a nearest point to the query point. 
 Reimplemented from mitkPointSet.  | 
  
      
  | 
  ||||||||||||
| 
 Get nearest point to a set of query points. 
 Reimplemented from mitkPointSet.  | 
  
      
  | 
  ||||||||||||
| 
 Get points in a bounding box. 
 Reimplemented from mitkPointSet.  | 
  
      
  | 
  ||||||||||||||||
| 
 Get points in a given circle/sphere. 
 Reimplemented from mitkPointSet.  | 
  
      
  | 
  
| 
 Initialize the point set. (build tree) Reimplemented from mitkPointSet.  | 
  
 1.4.3