|
CGAL 6.0 - 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_contained_elements | A class used to choose when a node should be split depending on the number of contained elements |
| CMaximum_depth | A class used to choose when a node should be split depending on the depth |
| CMaximum_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 |
| CPostorder_traversal | A class used for performing a postorder traversal |
| CPreorder_traversal | A class used for performing a preorder traversal |
| COrthtree | A data structure using an axis-aligned hyperrectangle decomposition of dD space for efficient access and computation |
| COrthtree_traits | Traits class for defining an orthtree using the class CGAL::Orthtree without storing data in the nodes |
| COrthtree_traits_base | The class Orthtree_traits_base is a base class providing common choices for types and functors |
| ▼COrthtree_traits_face_graph | Traits class for the Orthtree class to be used to construct a 3D octree around a triangulated surface mesh |
| CSplit_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 |
| COrthtree_traits_point | Traits class for defining an orthtree of points using the class CGAL::Orthtree |
| CCollectionPartitioningOrthtreeTraits | Refinement of the OrthtreeTraitsWithData concept, adding requirements for the traits class of a CGAL::Orthtree in order to supports nearest-neighbor searching |
| COrthtreeTraits | The concept OrthtreeTraits defines the requirements for the template parameter of the CGAL::Orthtree class |
| COrthtreeTraitsWithData | The concept OrthtreeTraitsWithData defines the requirements for the template parameter of the CGAL::Orthtree class for a node type that stores data |
| COrthtreeTraversal | Requirements for defining a traversal strategy of an orthtree |