Pierre Alliez, Stéphane Tayeb, Camille Wormser
The AABB (axis-aligned bounding box) tree component offers a static data structure and algorithms to perform efficient intersection and distance queries on sets of finite 3D geometric objects.
Concepts
Classes
Primitives
CGAL::AABB_triangle_primitive<GeomTraits, Iterator, CacheDatum>
CGAL::AABB_segment_primitive<GeomTraits, Iterator, CacheDatum>
CGAL::AABB_primitive<Id,ObjectPropertyMap,PointPropertyMapPolyhedron,ExternalPropertyMaps,CacheDatum>
CGAL::AABB_halfedge_graph_segment_primitive<HalfedgeGraph,Vpm,OneHalfedgeGraphPerTree,CacheDatum>
CGAL::AABB_face_graph_triangle_primitive<FaceGraph,Vpm,OneFaceGraphPerTree,CacheDatum>
|
class | CGAL::AABB_face_graph_triangle_primitive< FaceGraph, VertexPointPMap, OneFaceGraphPerTree, CacheDatum > |
|
class | CGAL::AABB_halfedge_graph_segment_primitive< HalfedgeGraph, VertexPointPMap, OneHalfedgeGraphPerTree, CacheDatum > |
|
class | CGAL::AABB_polyhedron_segment_primitive< GeomTraits, Polyhedron > |
|
class | CGAL::AABB_polyhedron_triangle_primitive< GeomTraits, Polyhedron > |
|
struct | CGAL::AABB_primitive< Id, ObjectPropertyMap, PointPropertyMap, ExternalPropertyMaps, CacheDatum > |
|
class | CGAL::AABB_segment_primitive< GeomTraits, Iterator, CacheDatum > |
|
class | CGAL::AABB_tree< AABBTraits > |
| Static data structure for efficient intersection and distance computations in 3D. More...
|
|
class | CGAL::AABB_traits< GeomTraits, AABBPrimitive, BboxMap > |
| This traits class handles any type of 3D geometric primitives provided that the proper intersection tests and constructions are implemented. More...
|
|
class | CGAL::AABB_triangle_primitive< GeomTraits, Iterator, CacheDatum > |
|