CGAL 4.7 - 3D Fast Intersection and Distance Computation (AABB Tree): Class and Concept List

\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)

CGAL 4.7 - 3D Fast Intersection and Distance Computation (AABB Tree)

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
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]

CGAL |
AABB_face_graph_triangle_primitive | Primitive type for a facet of a polyhedral surface
AABB_halfedge_graph_segment_primitive | Primitive type for a edge of a polyhedral surface
AABB_polyhedron_segment_primitive |
AABB_polyhedron_triangle_primitive |
AABB_primitive | Generic primitive type
AABB_segment_primitive | Primitive type that uses as identifier an iterator with a 3D segment as `value_type`
AABB_traits | This traits class handles any type of 3D geometric primitives provided that the proper intersection tests and constructions are implemented
Intersection_and_primitive_id | `Intersection_and_primitive_id<Query>::Type::first_type` is found according to the result type of `GeomTraits::Intersect_3::operator()`, (that is cpp11::result_of<GeomTraits::Intersect_3(Query, Primitive::Datum)>::type)
AABB_tree | Class AABB_tree is a static data structure for efficient intersection and distance computations in 3D
AABB_triangle_primitive | Primitive type that uses as identifier an iterator with a 3D triangle as `value_type`
AABBGeomTraits | The concept `AABBGeomTraits` defines the requirements for the first template parameter of the class `CGAL::AABB_traits<AABBGeomTraits, AABBPrimitive>`. It provides predicates and constructors to detect and compute intersections between query objects and the primitives stored in the AABB tree. In addition, it contains predicates and constructors to compute distances between a point query and the primitives stored in the AABB tree
AABBPrimitive | The concept `AABBPrimitive` describes the requirements for the primitives stored in the AABB tree data structure. The concept encapsulates a type for the input datum (a geometric object) and an identifier (id) type through which those primitives are referred to. The concept `AABBPrimitive` also refines the concepts DefaultConstructible and Assignable
AABBPrimitiveWithSharedData | The concept `AABBPrimitiveWithSharedData` describes the requirements for the primitives stored in the AABB tree data structure. The concept encapsulates a type for the input datum (a geometric object) and an identifier (id) type through which those primitives are referred to. The concept `AABBPrimitiveWithSharedData` also refines the concepts `DefaultConstructible` and `Assignable`. The concept is similar to `AABBPrimitive` except that some data stored outside of the primitives are required to access the datum and the reference point
AABBTraits | The concept `AABBTraits` provides the geometric primitive types and methods for the class `CGAL::AABB_tree<AABBTraits>`