bbox(const Node &node) const | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
Bbox typedef | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
Degree typedef | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
depth() const | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
Dimension typedef | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
FT typedef | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
grade() | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
intersected_nodes(const Query &query, OutputIterator output) const | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
locate(const Point &point) const | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
nearest_neighbors(const Point &query, std::size_t k, OutputIterator output) const | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
nearest_neighbors(const Sphere &query, OutputIterator output) const | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
Node_range typedef | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
operator!=(const Self &rhs) const | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
operator==(const Self &rhs) const | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
operator[](std::size_t index) const | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
Orthtree(PointRange &point_range, PointMap point_map=PointMap(), const FT enlarge_ratio=1.2, Traits traits=Traits()) | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
Point typedef | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
PointMap typedef | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
PointRange typedef | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
refine(const Split_predicate &split_predicate) | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
refine(size_t max_depth=10, size_t bucket_size=20) | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
root() const | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
Self typedef | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
Sphere typedef | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
Split_predicate typedef | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |
traverse(const Traversal &traversal=Traversal()) const | CGAL::Orthtree< Traits_, PointRange_, PointMap_ > | |