Loading [MathJax]/extensions/MathMenu.js
 
CGAL 6.0.1 - Quadtrees, Octrees, and Orthtrees
All Classes Namespaces Files Functions Variables Typedefs Enumerations Friends Modules Pages
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 123]
 NCGAL
 NOrthtrees
 CLeaves_traversalA class used for performing a traversal on leaves only
 CLevel_traversalA class used for performing a traversal of a specific depth level
 CMaximum_contained_elementsA class used to choose when a node should be split depending on the number of contained elements
 CMaximum_depthA class used to choose when a node should be split depending on the depth
 CMaximum_depth_and_maximum_contained_elementsA class used to choose when a node should be split depending on the depth and the number of contained elements
 CPostorder_traversalA class used for performing a postorder traversal
 CPreorder_traversalA class used for performing a preorder traversal
 COrthtreeA data structure using an axis-aligned hyperrectangle decomposition of dD space for efficient access and computation
 COrthtree_traitsTraits class for defining an orthtree using the class CGAL::Orthtree without storing data in the nodes
 COrthtree_traits_baseThe class Orthtree_traits_base is a base class providing common choices for types and functors
 COrthtree_traits_face_graphTraits class for the Orthtree class to be used to construct a 3D octree around a triangulated surface mesh
 CSplit_predicate_node_min_extentRecommended 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_pointTraits class for defining an orthtree of points using the class CGAL::Orthtree
 CCollectionPartitioningOrthtreeTraitsRefinement of the OrthtreeTraitsWithData concept, adding requirements for the traits class of a CGAL::Orthtree in order to supports nearest-neighbor searching
 COrthtreeTraitsThe concept OrthtreeTraits defines the requirements for the template parameter of the CGAL::Orthtree class
 COrthtreeTraitsWithDataThe concept OrthtreeTraitsWithData defines the requirements for the template parameter of the CGAL::Orthtree class for a node type that stores data
 COrthtreeTraversalRequirements for defining a traversal strategy of an orthtree