|
Alexandria
2.27.0
SDC-CH common library for the Euclid project
|
#include <KdTree.h>

Classes | |
| class | Leaf |
| class | Node |
| class | Split |
Public Types | |
| using | Traits = KdTreeTraits< T > |
Public Member Functions | |
| 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 |
| using KdTree::KdTree< T, DistanceMethod >::Traits = KdTreeTraits<T> |
|
explicit |
Definition at line 123 of file KdTree.icpp.
References std::vector< T >::empty(), std::vector< T >::front(), std::move(), and std::vector< T >::size().

| 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 146 of file KdTree.icpp.
References KdTree::KdTree< T, DistanceMethod >::countPointsWithinRadius().
Referenced by KdTree::KdTree< T, DistanceMethod >::countPointsWithinRadius().

| 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 139 of file KdTree.icpp.
|
private |
|
private |
1.8.5