add_element(const point_t &point, const data_t &data, bool delayInsertion=false) | ug::KDTree< point_t, data_t, real_t > | |
closest_element(const point_t &point) const | ug::KDTree< point_t, data_t, real_t > | |
closest_elements(vector< Element > &elemsOut, const point_t &point, size_t n) const | ug::KDTree< point_t, data_t, real_t > | |
empty() const | ug::KDTree< point_t, data_t, real_t > | |
estimate_balance_quality() | ug::KDTree< point_t, data_t, real_t > | |
find_leaf_node(const point_t &point) | ug::KDTree< point_t, data_t, real_t > | private |
m_desc | ug::KDTree< point_t, data_t, real_t > | private |
m_elements | ug::KDTree< point_t, data_t, real_t > | private |
m_nodes | ug::KDTree< point_t, data_t, real_t > | private |
m_numDelayedElements | ug::KDTree< point_t, data_t, real_t > | private |
num_delayed_elements() const | ug::KDTree< point_t, data_t, real_t > | |
rebalance() | ug::KDTree< point_t, data_t, real_t > | |
set_desc(const KDTreeDesc &desc) | ug::KDTree< point_t, data_t, real_t > | |
size() const | ug::KDTree< point_t, data_t, real_t > | |
split_leaf_node(Node &node) | ug::KDTree< point_t, data_t, real_t > | private |