Alexandria
2.19
Please provide a description of the project.
|
#include <KdTree.h>
Classes | |
struct | Coord |
class | Leaf |
class | Node |
class | Split |
Public Types | |
using | Traits = KdTreeTraits< T > |
Public Member Functions | |
KdTree (const std::vector< T > &data) | |
std::vector< T > | findPointsWithinRadius (Coord coord, double radius) const |
Private Attributes | |
std::shared_ptr< Node > | m_root |
using KdTree::KdTree< T, N, S >::Traits = KdTreeTraits<T> |
|
explicit |
Definition at line 113 of file KdTree.icpp.
References std::move(), and std::vector< T >::size().
std::vector< T > KdTree::KdTree< T, N, S >::findPointsWithinRadius | ( | Coord | coord, |
double | radius | ||
) | const |
Definition at line 123 of file KdTree.icpp.
References KdTree::KdTree< T, N, S >::findPointsWithinRadius().
Referenced by KdTree::KdTree< T, N, S >::findPointsWithinRadius().
|
private |