template<typename Coordinate, ::std::size_t Dimension, typename Region = BoundingRegion<Coordinate>, typename Distance = details::SquaredDistance<Coordinate, Dimension>, typename NodeCmp = details::NodeCmp<Dimension>>
class maliput::math::KDTree< Coordinate, Dimension, Region, Distance, NodeCmp >
N-Dimension KDTree.
See KDTreeBase for details.
|
template<typename Iterator > |
| KDTree (Iterator begin, Iterator end) |
|
template<typename Collection > |
| KDTree (Collection &&points) |
| Constructs a KDTreeBase taking a vector of points. More...
|
|
| KDTreeBase (Iterator begin, Iterator end) |
| Constructs a KDTreeBase taking a pair of iterators. More...
|
|
| KDTreeBase (Collection &&points) |
| Constructs a KDTreeBase taking a vector of points. More...
|
|
const Coordinate & | nearest_point (const Coordinate &point) const |
| Finds the nearest point in the tree to the given point. More...
|
|
const Coordinate & | nearest_point (const Coordinate &point, double tolerance) const |
| Finds the nearest point in the tree to the given point. More...
|
|