kd_tree.h File Reference

This header defines the kd_tree class and its support classes. More...

#include <ssrc/spatial/detail/kd_tree_range_search_iterator.h>
#include <ssrc/spatial/detail/kd_tree_node.h>
#include <ssrc/spatial/detail/kd_tree_nearest_neighbor.h>
#include <ssrc/spatial/rectangle_region.h>
#include <algorithm>
#include <utility>
#include <vector>

Include dependency graph for kd_tree.h:

Go to the source code of this file.

Classes
struct	spatial::kd_tree_traits< Tree >
	kd_tree_traits stores metadata about kd_tree instances. More...
struct	spatial::kd_tree_const_traits< Tree >
	kd_tree_const_traits stores metadata about const kd_tree instances. More...
class	spatial::kd_tree< Point, Value, Discriminator, Size >
	A k-d tree divides a k-dimensional space relative to the points it contains by storing them in a binary tree, discriminating by a different dimension at each level of the tree. More...
struct	spatial::kd_tree< Point, Value, Discriminator, Size >::node_comparator
Namespaces
namespace	spatial
	The spatial namespace houses data structures and algorithms for spatial data structures and concerns itself primarily with range searching.

---

Detailed Description

This header defines the kd_tree class and its support classes.

Definition in file kd_tree.h.