|
cheshirekow
v0.1.0
|
#include <mpblocks/kd_tree/euclidean/Ball.h>#include <mpblocks/kd_tree/euclidean/Distance.h>#include <mpblocks/kd_tree/euclidean/Key.h>#include <mpblocks/kd_tree/euclidean/HyperRect.h>#include <mpblocks/kd_tree/euclidean/KNearest.h>#include <mpblocks/kd_tree/euclidean/KNearestBall.h>#include <mpblocks/kd_tree/euclidean/KNearestBallCenter.h>#include <mpblocks/kd_tree/euclidean/Nearest.h>Go to the source code of this file.
Classes | |
| class | mpblocks::kd_tree::euclidean::Ball< Traits, Allocator > |
| struct | mpblocks::kd_tree::euclidean::Distance< Traits > |
| provides euclidean distance computation More... | |
| struct | mpblocks::kd_tree::euclidean::HyperRect< Traits > |
| an NDim dimensional hyperrectangle, represented as a min and max extent More... | |
| struct | mpblocks::kd_tree::euclidean::Key< Traits > |
| class | mpblocks::kd_tree::euclidean::KNearest< Traits, Allocator > |
| class | mpblocks::kd_tree::euclidean::KNearestBall< Traits, Allocator > |
| class | mpblocks::kd_tree::euclidean::KNearestBallCenter< Traits, Allocator > |
| performs search for k-NN within a ball at a specified center and radius More... | |
| class | mpblocks::kd_tree::euclidean::Nearest< Traits > |
| provides a search algorithm for finding the nearest point in the kd tree to some query point. More... | |
Namespaces | |
| mpblocks | |
| mpblocks::kd_tree | |
| implements a kd-tree, a multidimensional search tree for points | |
| mpblocks::kd_tree::euclidean | |
| search implementations for a euclean metric space, distance is euclidean distance, ball is a euclidean ball | |
Definition in file euclidean.h.