CGAL 4.7 - Bounding Volumes: Concepts

\( \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 - Bounding Volumes

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Classes
Concepts
Bounding Volumes Reference

##

## Concepts

concept | ApproximateMinEllipsoid_d_Traits_d
| This concept defines the requirements for traits classes of `CGAL::Approximate_min_ellipsoid_d<Traits>`. More...
concept | Circle

An object of the class `Circle` is a circle in two-dimensional Euclidean plane \( \E^2\). Its boundary splits the plane into a bounded and an unbounded side. By definition, an empty `Circle` has no boundary and no bounded side, i.e. its unbounded side equals the whole plane \( \E^2\). A `Circle` containing exactly one point \( p\) has no bounded side, its boundary is \( \{p\}\), and its unbounded side equals \( \E^2 \setminus \{p\}\). More...

concept | Ellipse

An object `ellipse` of the class `Ellipse` is an ellipse in two-dimensional Euclidean plane \( \E^2\). Its boundary splits the plane into a bounded and an unbounded side. By definition, an empty `ellipse` has no boundary and no bounded side, i.e. its unbounded side equals the whole plane \( \E^2\). More...

concept | MinCircle2Traits
| This concept defines the requirements for traits classes of `CGAL::Min_circle_2<Traits>`. More...
concept | MinEllipse2Traits
| This concept defines the requirements for traits classes of `CGAL::Min_ellipse_2<Traits>`. More...
concept | MinQuadrilateralTraits_2
| The concept `MinQuadrilateralTraits_2` defines types and operations needed to compute minimum enclosing quadrilaterals of a planar point set using the functions `min_rectangle_2`, `min_parallelogram_2` and `min_strip_2`. More...
concept | MinSphereAnnulusDTraits
| This concept defines the requirements for traits classes of \( d\)-dimensional min sphere and min annulus algorithms. More...
concept | MinSphereOfSpheresTraits
| A model of concept `MinSphereOfSpheresTraits` must provide the following constants, types, predicates and operations. More...
concept | RectangularPCenterTraits_2
| The concept `RectangularPCenterTraits_2` defines types and operations needed to compute rectilinear \( p\)-centers of a planar point set using the function `CGAL::rectangular_p_center_2`. More...