Alexandria 2.31.2
SDC-CH common library for the Euclid project
|
Public Types | |
using | Traits |
Public Member Functions | |
virtual void | findPointsWithinRadius (const T &coord, double radius, std::vector< T > &selection) const =0 |
virtual std::size_t | countPointsWithinRadius (const T &coord, double radius) const =0 |
virtual | ~Node ()=default |
KdTree (const std::vector< T > &data, std::size_t leaf_size=100) | |
std::vector< T > | findPointsWithinRadius (const T &coord, double radius) const |
std::size_t | countPointsWithinRadius (const T &coord, double radius) const |
Private Attributes | |
std::size_t | m_dimensionality |
std::shared_ptr< Node > | m_root |
Definition at line 23 of file KdTree.icpp.
using KdTree::KdTree< T, DistanceMethod >::Traits |
|
virtualdefault |
std::size_t KdTree::KdTree< T, DistanceMethod >::countPointsWithinRadius | ( | const T & | coord, |
double | radius ) const |
Count how many points are within the given radius from the coordonate coord
coord | |
radius |
Definition at line 88 of file KdTree.icpp.
|
pure virtual |
std::vector< T > KdTree::KdTree< T, DistanceMethod >::findPointsWithinRadius | ( | const T & | coord, |
double | radius ) const |
Return the points that are within the given radius from the coordinate coord
coord | |
radius |
Definition at line 80 of file KdTree.icpp.
|
pure virtual |
|
explicit |
Definition at line 72 of file KdTree.icpp.
|
private |
|
private |