CGAL 4.7 - Intersecting Sequences of dD Iso-oriented Boxes: 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 - Intersecting Sequences of dD Iso-oriented Boxes

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 |
Box_intersection_d |
Box_d | `Box_d` is a generic iso-oriented bounding box in dimension \( D\)
Box_traits_d | This is the default traits class for the intersection algorithms for iso-oriented boxes
Box_with_handle_d | `Box_with_handle_d` is a generic iso-oriented bounding box in dimension \( D\) that stores additionally a handle to some underlying geometric object
BoxIntersectionBox_d | The `BoxIntersectionBox_d` concept is used in the context of the intersection algorithms for sequences of iso-oriented boxes. These algorithms come with a default traits class that assumes that the boxes are a model of this `BoxIntersectionBox_d` concept. This concept defines the access functions to the dimension, the `id`-number, and the boundaries of the box
BoxIntersectionTraits_d | The `BoxIntersectionTraits_d` concept is used for the intersection algorithms for sequences of iso-oriented boxes. This concept defines the access functions to the dimension, the `id`-number, and the boundaries of the boxes manipulated in these algorithms