Space-efficient geometric algorithms and data structures By Ilya Katz and Hervé Brönnimann

static_kd_tree.hpp File Reference

Go to the source code of this file.

Namespaces
namespace	inplaceds
Functions
template<class RandomAccessIterator, class AxisAlignedGeometry>
void	inplaceds::build_static_kdtree (RandomAccessIterator first, RandomAccessIterator last, AxisAlignedGeometry geom)
	Builds a static kd-tree by reordering points in the range [first,last).
template<class Box, class RandomAccessIterator, class OutputIterator, class AxisAlignedGeometry>
OutputIterator	inplaceds::window_query_static_kdtree (RandomAccessIterator first, RandomAccessIterator last, AxisAlignedGeometry geom, Box Q, OutputIterator result)
	Returns iterator to a collection of points within box Q.
template<class Halfplane, class RandomAccessIterator, class OutputIterator, class AxisAlignedGeometry>
OutputIterator	inplaceds::halfplane_query_static_kdtree (RandomAccessIterator first, RandomAccessIterator last, AxisAlignedGeometry geom, Halfplane H, OutputIterator result)
	Returns iterator to a collection of points that lie in halfplane H.
template<class Box, class RandomAccessIterator, class OutputIterator, class AxisAlignedGeometry>
OutputIterator	inplaceds::closed_triangle_query_static_kdtree (RandomAccessIterator first, RandomAccessIterator last, AxisAlignedGeometry geom, Box Q, OutputIterator result)
	Returns iterator to a collection of points within closed triangle T.

---

Code Documentation generated Using Doxygen

Copyright © Ilya Katz and Hervé Brönnimann, 2005, 2006.