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_static_kdtree ( RandomAccessIterator first,

RandomAccessIterator last,

AxisAlignedGeometry geom

)

Builds a static kd-tree by reordering points in the range [first,last).

Definition at line 24 of file static_kd_tree.hpp.

Code Documentation generated Using Doxygen