|
CGAL 5.6 - Quadtrees, Octrees, and Orthtrees
|
| ▼NCGAL | |
| ▼NOrthtrees | |
| CLeaves_traversal | A class used for performing a traversal on leaves only |
| CLevel_traversal | A class used for performing a traversal of a specific depth level |
| CMaximum_depth | A class used to choose when a node should be split depending on the depth |
| CMaximum_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 |
| CMaximum_number_of_inliers | A class used to choose when a node should be split depending on the number of inliers |
| CPostorder_traversal | A class used for performing a postorder traversal |
| CPreorder_traversal | A class used for performing a preorder traversal |
| COctree | Alias that specializes the Orthtree class to a 3D octree |
| ▼COrthtree | A data structure using an axis-aligned hybercubic decomposition of dD space for efficient point access and computations |
| CNode | Single node of the tree |
| COrthtree_traits_2 | The class Orthtree_traits_2 can be used as a template parameter of the Orthtree class |
| COrthtree_traits_3 | The class Orthtree_traits_3 can be used as a template parameter of the Orthtree class |
| COrthtree_traits_d | The class Orthtree_traits_d can be used as a template parameter of the Orthtree class |
| CQuadtree | Alias that specializes the Orthtree class to a 2D quadtree |
| COrthtreeTraits | The concept OrthtreeTraits defines the requirements for the template parameter of the CGAL::Orthtree class |
| COrthtreeTraversal | Traversal provides the functions needed to traverse the nodes of an orthtree |