K Discrete Oriented Polytope Tree (K-DOP Tree) Reference

^^

^^

Xiao Xiao, Fehmi Cirak, Andreas Fabri

This package provides a bounding volume hierarchy based on discrete oriented polytopes and efficient algorithms for ray and distance queries using k-DOPs.

Introduced in: CGAL 5.0
Depends on: 3D Fast Intersection and Distance Computation
BibTeX: cgal:xcf-kdopt-19b
License: GPL

Classified Reference Pages

Concepts

• KDOPTraits
• KDOPKdop
• KDOPTree

Algorithms

• CGAL::KDOP_tree::Construct_kdop<GeomTraits, N>

Classes

• CGAL::KDOP_tree::KDOP_traits<N, GeomTraits, KDOPPrimitive, BboxMap, KDOPMap>
• CGAL::KDOP_tree::KDOP_tree<KDOPTraits>
• CGAL::KDOP_tree::KDOP_kdop<GeomTraits, N>

Modules
	Concepts
	Algorithm Classes
	Traits Classes

Classes
class	CGAL::KDOP_tree::KDOP_kdop< GeomTraits, N >
	Class KDOP_kdop is a data structure to store k-dop of primitives and to check overlaps with k-dops. More...
class	CGAL::KDOP_tree::KDOP_traits< N, GeomTraits, KDOPPrimitive, BboxMap, KDOPMap >
class	CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
	Class KDOP_tree is a static data structure for efficient intersection in 3D. More...