Abstract interface for storing and searching through a set of points. Query functions for nearest neighbour searches are defined.
More...
#include <SearchTree.hpp>
|
| 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 int | kSearch (const BaseVecT &qp, int k, std::vector< size_t > &indices) const |
| | Like the other overload, but ignoring the distances vector. More...
|
| |
| virtual void | radiusSearch (const BaseVecT &qp, CoordT r, std::vector< size_t > &indices) const =0 |
| | Returns all points within the radius r of qp. More...
|
| |
| virtual | ~SearchTree ()=default |
| |
|
| int | m_kd |
| | The number of tangent planes used for distance determination. More...
|
| |
| int | m_ki |
| | Set the number of neighbours used to estimate and interpolate normals. More...
|
| |
|
| using | CoordT = typename BaseVecT::CoordType |
| |
template<typename BaseVecT>
class lvr2::SearchTree< BaseVecT >
Abstract interface for storing and searching through a set of points. Query functions for nearest neighbour searches are defined.
Definition at line 50 of file SearchTree.hpp.
◆ CoordT
template<typename BaseVecT >
◆ ~SearchTree()
template<typename BaseVecT >
◆ kSearch() [1/2]
template<typename BaseVecT >
| virtual int lvr2::SearchTree< BaseVecT >::kSearch |
( |
const BaseVecT & |
qp, |
|
|
int |
k, |
|
|
std::vector< size_t > & |
indices, |
|
|
std::vector< CoordT > & |
distances |
|
) |
| const |
|
pure virtual |
This function performs a k-next-neighbor search on the data that was given in the constructor.
- Parameters
-
| qp | The query point. |
| k | The number of neighbours that should be searched. |
| indices | A vector that stores the indices for the neighbours within the dataset. |
| distances | A vector that stores the distances for the neighbours that are found. |
- Returns
- The number of neighbours found
◆ kSearch() [2/2]
template<typename BaseVecT >
| virtual int lvr2::SearchTree< BaseVecT >::kSearch |
( |
const BaseVecT & |
qp, |
|
|
int |
k, |
|
|
std::vector< size_t > & |
indices |
|
) |
| const |
|
virtual |
Like the other overload, but ignoring the distances vector.
◆ radiusSearch()
template<typename BaseVecT >
| virtual void lvr2::SearchTree< BaseVecT >::radiusSearch |
( |
const BaseVecT & |
qp, |
|
|
CoordT |
r, |
|
|
std::vector< size_t > & |
indices |
|
) |
| const |
|
pure virtual |
Returns all points within the radius r of qp.
- Parameters
-
| qp | The query point. |
| r | Radius. |
| indices | A vector that will be filled with the indices of the points that were found. |
◆ m_kd
template<typename BaseVecT >
The number of tangent planes used for distance determination.
Definition at line 127 of file SearchTree.hpp.
◆ m_ki
template<typename BaseVecT >
Set the number of neighbours used to estimate and interpolate normals.
Set the number of neighbours used for normal estimation Get the number of tangent planes used for distance determination Get the number of neighbours used to estimate and interpolate normals.The number of neighbors used for normal interpolation
Definition at line 124 of file SearchTree.hpp.
The documentation for this class was generated from the following file:
