Quadtree, Octree and Orthtree Reference

Jackson Campolattaro, Simon Giraudot, Cédric Portaneri, Tong Zhao, Pierre Alliez

The Orthtree package provides a data structure that subdivides space, with specializations for 2D (Quadtree) and 3D (Octree), along with a collection of algorithms for operating on these structures.

Introduced in: CGAL 5.3
BibTeX: cgal:cpz-o-23b
License: GPL

Classified Reference Pages

Concepts

• OrthtreeTraits
• OrthtreeTraversal

Classes

• CGAL::Quadtree<GeomTraits, PointRange, PointMap>
• CGAL::Octree<GeomTraits, PointRange, PointMap>
• CGAL::Orthtree<Traits, PointRange, PointMap>

Traits

• CGAL::Orthtree_traits_2<GeomTraits>
• CGAL::Orthtree_traits_3<GeomTraits>
• CGAL::Orthtree_traits_d<GeomTraits, Dimension>

Split Predicates

• CGAL::Orthtrees::Maximum_number_of_inliers
• CGAL::Orthtrees::Maximum_depth
• CGAL::Orthtrees::Maximum_depth_and_maximum_number_of_inliers

Traversal

• CGAL::Orthtrees::Preorder_traversal
• CGAL::Orthtrees::Postorder_traversal
• CGAL::Orthtrees::Leaves_traversal
• CGAL::Orthtrees::Level_traversal

Modules
	Classes
	Concepts