Space-efficient geometric algorithms and data structures

By Ilya Katz and Hervé Brönnimann

dkd.hpp File Reference

Detailed Description

This file contains functions to build a true kd-tree, that is, a binary space partition tree in n-dimension.

Definition in file dkd.hpp.

Go to the source code of this file.

Namespaces

namespace inplaceds

Functions

template<class RandomAccessIterator, class AxisAlignedGeometry>

void inplaceds::build_kdtree (RandomAccessIterator first, RandomAccessIterator last, AxisAlignedGeometry geom, size_t dimensions)

template<class RandomAccessIterator, class AxisAlignedGeometry>

void inplaceds::build_kdtree (RandomAccessIterator first, RandomAccessIterator last, AxisAlignedGeometry geom, size_t dimensions, size_t pointDimension)

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

Code Documentation generated Using Doxygen


Namespaces
namespace	inplaceds
Functions
template<class RandomAccessIterator, class AxisAlignedGeometry>
void	inplaceds::build_kdtree (RandomAccessIterator first, RandomAccessIterator last, AxisAlignedGeometry geom, size_t dimensions)
template<class RandomAccessIterator, class AxisAlignedGeometry>
void	inplaceds::build_kdtree (RandomAccessIterator first, RandomAccessIterator last, AxisAlignedGeometry geom, size_t dimensions, size_t pointDimension)
	Builds a static multi dimentional kd-tree by reordering points in the range [first,last).