|
| KDTreeEigenMatrixAdaptor (const size_t dimensionality, const std::reference_wrapper< const MatrixType > &mat, const int leaf_max_size=10) |
| Constructor: takes a const ref to the matrix object with the data points. More...
|
|
| KDTreeEigenMatrixAdaptor (const self_t &)=delete |
|
void | query (const num_t *query_point, const size_t num_closest, IndexType *out_indices, num_t *out_distances_sq, const int=10) const |
|
|
const self_t & | derived () const |
|
self_t & | derived () |
|
size_t | kdtree_get_point_count () const |
|
num_t | kdtree_get_pt (const IndexType idx, size_t dim) const |
|
template<class BBOX > |
bool | kdtree_get_bbox (BBOX &) const |
|
template<class MatrixType, int DIM = -1, class Distance = nanoflann::metric_L2>
struct nanoflann::KDTreeEigenMatrixAdaptor< MatrixType, DIM, Distance >
An L2-metric KD-tree adaptor for working with data directly stored in an Eigen Matrix, without duplicating the data storage. Each row in the matrix represents a point in the state space.
Example of usage:
Eigen::Matrix<num_t,Dynamic,Dynamic> mat;
typedef KDTreeEigenMatrixAdaptor< Eigen::Matrix<num_t,Dynamic,Dynamic> >
my_kd_tree_t; const int max_leaf = 10; my_kd_tree_t mat_index(mat, max_leaf
); mat_index.index->buildIndex(); mat_index.index->...
- Template Parameters
-