|  | 
| virtual int | kSearch (const BaseVecT &qp, int k, vector< size_t > &indices, vector< CoordT > &distances) const override | 
|  | See interface documentation.  More... 
 | 
|  | 
| void | kSearchMany (const BaseVecT *query, int n, int k, size_t *indices, CoordT *distances) const | 
|  | 
| virtual void | radiusSearch (const BaseVecT &qp, CoordT r, vector< size_t > &indices) const override | 
|  | See interface documentation.  More... 
 | 
|  | 
|  | SearchTreeFlann (PointBufferPtr buffer) | 
|  | Takes the point-data and initializes the underlying searchtree.  More... 
 | 
|  | 
| virtual int | kSearch (const BaseVecT &qp, int k, std::vector< size_t > &indices) const | 
|  | Like the other overload, but ignoring the distancesvector.  More...
 | 
|  | 
| virtual int | kSearch (const BaseVecT &qp, int k, std::vector< size_t > &indices, std::vector< CoordT > &distances) const =0 | 
|  | This function performs a k-next-neighbor search on the data that was given in the constructor.  More... 
 | 
|  | 
| virtual void | radiusSearch (const BaseVecT &qp, CoordT r, std::vector< size_t > &indices) const =0 | 
|  | Returns all points within the radius rofqp.  More...
 | 
|  | 
| virtual | ~SearchTree ()=default | 
|  | 
template<typename BaseVecT>
class lvr2::SearchTreeFlann< BaseVecT >
SearchClass for point data. 
 This class uses the FLANN ( http://www.cs.ubc.ca/~mariusm/uploads/FLANN )
 library to implement a nearest neighbour search for point-data.
 
Definition at line 60 of file SearchTreeFlann.hpp.