|
Geogram Version 1.9.7
A programming library of geometric algorithms
|
This is the complete list of members for GEO::KdTree, including all inherited members.
| bbox_max_ (defined in GEO::KdTree) | GEO::KdTree | protected |
| bbox_min_ (defined in GEO::KdTree) | GEO::KdTree | protected |
| build_tree()=0 | GEO::KdTree | protectedpure virtual |
| Counted() | GEO::Counted | inlineprotected |
| create(coord_index_t dimension, const std::string &name="default") | GEO::NearestNeighborSearch | static |
| dimension() const | GEO::NearestNeighborSearch | inline |
| dimension_ (defined in GEO::NearestNeighborSearch) | GEO::NearestNeighborSearch | protected |
| exact() const | GEO::NearestNeighborSearch | inline |
| exact_ (defined in GEO::NearestNeighborSearch) | GEO::NearestNeighborSearch | protected |
| get_minmax(index_t b, index_t e, coord_index_t coord, double &minval, double &maxval) const | GEO::KdTree | inlineprotected |
| get_nearest_neighbor(const double *query_point) const | GEO::NearestNeighborSearch | inline |
| get_nearest_neighbors(index_t nb_neighbors, const double *query_point, index_t *neighbors, double *neighbors_sq_dist) const override | GEO::KdTree | virtual |
| get_nearest_neighbors(index_t nb_neighbors, const double *query_point, index_t *neighbors, double *neighbors_sq_dist, KeepInitialValues) const override | GEO::KdTree | virtual |
| get_nearest_neighbors(index_t nb_neighbors, index_t query_point, index_t *neighbors, double *neighbors_sq_dist) const override | GEO::KdTree | virtual |
| get_nearest_neighbors_leaf(index_t node_index, index_t b, index_t e, const double *query_point, NearestNeighbors &neighbors) const | GEO::KdTree | protectedvirtual |
| get_nearest_neighbors_recursive(index_t node_index, index_t b, index_t e, double *bbox_min, double *bbox_max, double bbox_dist, const double *query_point, NearestNeighbors &neighbors) const | GEO::KdTree | virtual |
| get_node(index_t n, index_t b, index_t e, index_t &left_child, index_t &right_child, coord_index_t &splitting_coord, index_t &m, double &splitting_val) const =0 | GEO::KdTree | protectedpure virtual |
| init_bbox_and_bbox_dist_for_traversal(double *bbox_min, double *bbox_max, double &box_dist, const double *query_point) const | GEO::KdTree | |
| is_shared() const | GEO::Counted | inline |
| KdTree(coord_index_t dim) | GEO::KdTree | |
| MAX_LEAF_SIZE | GEO::KdTree | protectedstatic |
| nb_points() const | GEO::NearestNeighborSearch | inline |
| nb_points_ (defined in GEO::NearestNeighborSearch) | GEO::NearestNeighborSearch | protected |
| nb_refs() const | GEO::Counted | inline |
| NearestNeighborSearch(coord_index_t dimension) | GEO::NearestNeighborSearch | protected |
| NearestNeighborSearch_var typedef | GEO::NearestNeighborSearch | related |
| NearestNeighborSearchFactory typedef | GEO::NearestNeighborSearch | related |
| point_index_ (defined in GEO::KdTree) | GEO::KdTree | protected |
| point_ptr(index_t i) const | GEO::NearestNeighborSearch | inline |
| points_ (defined in GEO::NearestNeighborSearch) | GEO::NearestNeighborSearch | protected |
| ref() const | GEO::Counted | inline |
| ref(const Counted *counted) | GEO::Counted | inlinestatic |
| root() const | GEO::KdTree | inline |
| root_ (defined in GEO::KdTree) | GEO::KdTree | protected |
| set_exact(bool x) | GEO::NearestNeighborSearch | virtual |
| set_points(index_t nb_points, const double *points) override | GEO::KdTree | virtual |
| set_points(index_t nb_points, const double *points, index_t stride) override | GEO::KdTree | virtual |
| spread(index_t b, index_t e, coord_index_t coord) const | GEO::KdTree | inlineprotected |
| stride_ (defined in GEO::NearestNeighborSearch) | GEO::NearestNeighborSearch | protected |
| stride_supported() const override | GEO::KdTree | virtual |
| unref() const | GEO::Counted | inline |
| unref(const Counted *counted) | GEO::Counted | inlinestatic |
| ~Counted() | GEO::Counted | protectedvirtual |
| ~KdTree() override | GEO::KdTree | protected |
| ~NearestNeighborSearch() override | GEO::NearestNeighborSearch | protected |