CGAL 5.6.3 - 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_depth | A class used to choose when a node should be split depending on the depth
C Maximum_depth_and_maximum_number_of_inliers | A class used to choose when a node should be split depending on the depth and the number of inliers
C Maximum_number_of_inliers | A class used to choose when a node should be split depending on the number of inliers
C Postorder_traversal | A class used for performing a postorder traversal
C Preorder_traversal | A class used for performing a preorder traversal
C Octree | Alias that specializes the `Orthtree` class to a 3D octree
▼C Orthtree | A data structure using an axis-aligned hybercubic decomposition of dD space for efficient point access and computations
C Node | Single node of the tree
C Orthtree_traits_2 | The class `Orthtree_traits_2` can be used as a template parameter of the `Orthtree` class
C Orthtree_traits_3 | The class `Orthtree_traits_3` can be used as a template parameter of the `Orthtree` class
C Orthtree_traits_d | The class `Orthtree_traits_d` can be used as a template parameter of the `Orthtree` class
C Quadtree | Alias that specializes the `Orthtree` class to a 2D quadtree
C OrthtreeTraits | The concept `OrthtreeTraits` defines the requirements for the template parameter of the `CGAL::Orthtree` class
C OrthtreeTraversal | Traversal provides the functions needed to traverse the nodes of an orthtree