kd_tree.h File Reference

#include <Eigen/Dense>
#include <mpblocks/kd_tree/ListBuilder.h>
#include <mpblocks/kd_tree/ListPair.h>
#include <mpblocks/kd_tree/NearestSearch.h>
#include <mpblocks/kd_tree/Node.h>
#include <mpblocks/kd_tree/RangeSearch.h>
#include <mpblocks/kd_tree/Tree.h>
#include <mpblocks/kd_tree/euclidean.h>
#include <mpblocks/kd_tree/r2_s1.h>

Go to the source code of this file.

Classes
struct	mpblocks::kd_tree::ListBuilder< Traits >
	Enumerates an entire subtree, building a list of nodes along with the hyperectangle bounding the subtree at that node. More...
struct	mpblocks::kd_tree::ListPair< Traits >
	pairs nodes of the Kd tree along with a hyperrectangle that is the bounding volume for the subtree rooted at that node More...
class	mpblocks::kd_tree::NearestSearchIface< Traits >
	Interface for nearest node type searches. More...
class	mpblocks::kd_tree::Node< Traits >
	Base class for nodes in the kd tree. More...
class	mpblocks::kd_tree::RangeSearchIface< Traits >
class	mpblocks::kd_tree::Tree< Traits >
	a simple KDtree class More...

Namespaces
	mpblocks
	mpblocks::kd_tree
	implements a kd-tree, a multidimensional search tree for points