Space Efficient Geometric Data Structures

Space-efficient geometric algorithms and data structures

By Ilya Katz and Hervé Brönnimann

template<class RandomAccessIterator, class AxisAlignedGeometry>

void inplaceds::build_dynamic_kdtree ( RandomAccessIterator first,

RandomAccessIterator last,

AxisAlignedGeometry geom

) [inline]

Returns true if [first, last) is a valid kd-tree data structure.

Requirements on types:

RandomAccessIterator is a model of [http://www.sgi.com/tech/stl/RandomAccessIterator.html]

AxisAlignedGeometry is a geometry kernel

Complexity:
$O(n\log{n})$

Definition at line 42 of file dynamic_kd_tree.hpp.

Code Documentation generated Using Doxygen