|
| tree_t (const tree_t< kd, point_t, data_t > &tree) |
|
tree_t< kd, point_t, data_t > & | operator= (const tree_t< kd, point_t, data_t > &tree) |
|
void | setup (point_t *points, const unsigned int num_pts) |
|
unsigned int | nn (const point_t &query, data_t &best_distance, std::list< nn_t > &nn_sorted, const unsigned int max_traversals=200, const unsigned int max_nn=3) const |
|
const node_t< kd, point_t, data_t > * | nn (const point_t &query, data_t &best_distance, unsigned int max_traversals=200) const |
|
unsigned int | neighbors (const point_t &query, const data_t &radius, std::list< nn_t > &nn_sorted, const unsigned int max_traversals=200) const |
|
void | dump (std::ostream &so) const |
|
|
node_t< kd, point_t, data_t > * | root_ |
|
The documentation for this class was generated from the following file: