CGAL 6.1.1 - Fast Intersection and Distance Computation (AABB Tree)

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 1 2 3]

▼N CGAL |
C AABB_face_graph_triangle_primitive | Primitive type for a facet of a polyhedral surface
C AABB_halfedge_graph_segment_primitive | Primitive type for an edge of a polyhedral surface
C AABB_indexed_triangle_primitive_2 | Primitive type that uses as identifier an iterator with a range of three indices as `value_type`
C AABB_polyline_segment_primitive_2 | Primitive type that uses as identifier an iterator with a 2D point as `value_type`
C AABB_primitive | Generic primitive type
C AABB_segment_primitive_2 | Primitive type that uses as identifier an iterator with a 2D segment as `value_type`
C AABB_segment_primitive_3 | Primitive type that uses as identifier an iterator with a 3D segment as `value_type`
▼C AABB_traits_2 | This traits class handles any type of 2D geometric primitives provided that the proper intersection tests and constructions are implemented
C Do_intersect | Function object using `GeomTraits::Do_intersect`
C Intersection_and_primitive_id | `Intersection_and_primitive_id<Query>::Type::first_type` is found according to the result type of `GeomTraits::Intersect_2::operator()`
▼C AABB_traits_3 | This traits class handles any type of 3D geometric primitives provided that the proper intersection tests and constructions are implemented
C Do_intersect | Function object using `GeomTraits::Do_intersect`
C Intersection_and_primitive_id | `Intersection_and_primitive_id<Query>::Type::first_type` is found according to the result type of `GeomTraits::Intersect_3::operator()`
C AABB_tree | Static data structure for efficient intersection and distance computations in 2D and 3D
C AABB_triangle_primitive_2 | Primitive type that uses as identifier an iterator with a 2D triangle as `value_type`
C AABB_triangle_primitive_3 | Primitive type that uses as identifier an iterator with a 3D triangle as `value_type`
C AABBGeomTraits_2 | The concept `AABBGeomTraits_2` defines the requirements for the first template parameter of the class `CGAL::AABB_traits_2<AABBGeomTraits_2, 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
C AABBGeomTraits_3 | The concept `AABBGeomTraits_3` defines the requirements for the first template parameter of the class `CGAL::AABB_traits_3<AABBGeomTraits_3, 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
C 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
C 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
C AABBRayIntersectionGeomTraits_2 | The concept `AABBRayIntersectionGeomTraits_2` is a refinement of the concept `AABBGeomTraits_2`. In addition to the types and functors required by `AABBGeomTraits_2` it also requires types and functors necessary to define the Intersection_distance functor (see `AABBRayIntersectionTraits`)
C AABBRayIntersectionGeomTraits_3 | The concept `AABBRayIntersectionGeomTraits_3` is a refinement of the concept `AABBGeomTraits_3`. In addition to the types required by `AABBGeomTraits_3` it also requires types and functors necessary to define the Intersection_distance functor
C AABBRayIntersectionTraits | The concept `AABBRayIntersectionTraits` is a refinement of the concept `AABBTraits`. In addition to the types and functions required by `AABBTraits` it also requires function objects to calculate the distance of an intersection along a ray
C AABBTraits | The concept `AABBTraits` provides the geometric primitive types and methods for the class `CGAL::AABB_tree<AABBTraits>`