UGDK
0.4.1
|
#include <ugdk/util/intervalkdtree.h>
Public Member Functions | |
IntervalKDTree (const Box< DIMENSIONS > &tree_bounding_box, unsigned int max_elements_per_leaf) | |
~IntervalKDTree () | |
void | Clear () |
void | Insert (Box< DIMENSIONS > bounding_box, T element) |
void | Remove (T element) |
void | Update (const Box< DIMENSIONS > &new_bounding_box, T element) |
std::vector< T > * | getIntersectingItems (const Box< DIMENSIONS > &boundary) const |
unsigned int | max_elements_per_leaf () |
ugdk::ikdtree::IntervalKDTree< T, DIMENSIONS >::IntervalKDTree | ( | const Box< DIMENSIONS > & | tree_bounding_box, |
unsigned int | max_elements_per_leaf | ||
) |
ugdk::ikdtree::IntervalKDTree< T, DIMENSIONS >::~IntervalKDTree | ( | ) |
void ugdk::ikdtree::IntervalKDTree< T, DIMENSIONS >::Clear | ( | ) |
std::vector< T > * ugdk::ikdtree::IntervalKDTree< T, DIMENSIONS >::getIntersectingItems | ( | const Box< DIMENSIONS > & | boundary | ) | const |
void ugdk::ikdtree::IntervalKDTree< T, DIMENSIONS >::Insert | ( | Box< DIMENSIONS > | bounding_box, |
T | element | ||
) |
unsigned int ugdk::ikdtree::IntervalKDTree< T, DIMENSIONS >::max_elements_per_leaf | ( | ) |
void ugdk::ikdtree::IntervalKDTree< T, DIMENSIONS >::Remove | ( | T | element | ) |
void ugdk::ikdtree::IntervalKDTree< T, DIMENSIONS >::Update | ( | const Box< DIMENSIONS > & | new_bounding_box, |
T | element | ||
) |