CGAL 6.2 - Quadtrees, Octrees, and Orthtrees

Loading...
Searching...
No Matches
Class and Concept List
Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.
[detail level 1 2 3]

▼N CGAL |
▼N Orthtrees |
C Leaves_traversal | A class used for performing a traversal on leaves only
C Level_traversal | A class used for performing a traversal of a specific depth level
C Maximum_contained_elements | A class used to choose when a node should be split depending on the number of contained elements
C Maximum_depth | A class used to choose when a node should be split depending on the depth
C Maximum_depth_and_maximum_contained_elements | A class used to choose when a node should be split depending on the depth and the number of contained elements
C Postorder_traversal | A class used for performing a postorder traversal
C Preorder_traversal | A class used for performing a preorder traversal
C Orthtree | A data structure using an axis-aligned hyperrectangle decomposition of dD space for efficient access and computation
C Orthtree_traits | Traits class for defining an orthtree using the class `CGAL::Orthtree` without storing data in the nodes
C Orthtree_traits_base | The class `Orthtree_traits_base` is a base class providing common choices for types and functors
▼C Orthtree_traits_face_graph | Traits class for the `Orthtree` class to be used to construct a 3D octree around a triangulated surface mesh
C Split_predicate_node_min_extent | Recommended split predicate to pass to `Orthtree::refine()` function so that the octree is refined until a node is either empty or has an extent that would be smaller after split than the corresponding value provided to the constructor
C Orthtree_traits_point | Traits class for defining an orthtree of points using the class `CGAL::Orthtree`
C CollectionPartitioningOrthtreeTraits | Refinement of the `OrthtreeTraitsWithData` concept, adding requirements for the traits class of a `CGAL::Orthtree` in order to supports nearest-neighbor searching
C OrthtreeTraits | The concept `OrthtreeTraits` defines the requirements for the template parameter of the `CGAL::Orthtree` class
C OrthtreeTraitsWithData | The concept `OrthtreeTraitsWithData` defines the requirements for the template parameter of the `CGAL::Orthtree` class for a node type that stores data
C OrthtreeTraversal | Requirements for defining a traversal strategy of an orthtree