Go to the documentation of this file.
   35 #ifndef LVR2_RECONSTRUCTION_SEARCHTREEFLANN_HPP_ 
   36 #define LVR2_RECONSTRUCTION_SEARCHTREEFLANN_HPP_ 
   41 #include <flann/flann.hpp> 
   48 using std::unique_ptr;
 
   59 template<
typename BaseVecT>
 
   63     using CoordT = 
typename BaseVecT::CoordType;
 
   78         vector<size_t>& indices,
 
   79         vector<CoordT>& distances
 
   86         vector<size_t>& indices
 
   90         const BaseVecT* query,
 
  100     unique_ptr<flann::Index<flann::L2_Simple<CoordT>>> 
m_tree;
 
  107 #include "lvr2/reconstruction/SearchTreeFlann.tcc" 
  
typename BaseVecT::CoordType CoordT
std::shared_ptr< PointBuffer > PointBufferPtr
boost::shared_array< CoordT > m_data
void kSearchMany(const BaseVecT *query, int n, int k, size_t *indices, CoordT *distances) const
SearchClass for point data.
virtual void radiusSearch(const BaseVecT &qp, CoordT r, vector< size_t > &indices) const override
See interface documentation.
unique_ptr< flann::Index< flann::L2_Simple< CoordT > > > m_tree
The FLANN search tree structure.
SearchTreeFlann(PointBufferPtr buffer)
Takes the point-data and initializes the underlying searchtree.
virtual int kSearch(const BaseVecT &qp, int k, vector< size_t > &indices, vector< CoordT > &distances) const override
See interface documentation.
Abstract interface for storing and searching through a set of points. Query functions for nearest nei...
lvr2
Author(s): Thomas Wiemann 
, Sebastian Pütz , Alexander Mock , Lars Kiesow , Lukas Kalbertodt , Tristan Igelbrink , Johan M. von Behren , Dominik Feldschnieders , Alexander Löhr 
autogenerated on Wed Mar 2 2022 00:37:25