\( \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.6 - Bounding Volumes
 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 12]
oNCGAL
|oCApproximate_min_ellipsoid_dAn object of class Approximate_min_ellipsoid_d is an approximation to the ellipsoid of smallest volume enclosing a finite multiset of points in \( d\)-dimensional Euclidean space \( \E^d\), \( d\ge 2\)
|oCApproximate_min_ellipsoid_d_traits_2The class Approximate_min_ellipsoid_d_traits_2 is a traits class for CGAL::Approximate_min_ellipsoid_d<Traits> using the 2-dimensional CGAL kernel
|oCApproximate_min_ellipsoid_d_traits_3The class Approximate_min_ellipsoid_d_traits_3 is a traits class for CGAL::Approximate_min_ellipsoid_d<Traits> using the 3-dimensional CGAL kernel
|oCApproximate_min_ellipsoid_d_traits_dThe class Approximate_min_ellipsoid_d_traits_d is a traits class for CGAL::Approximate_min_ellipsoid_d<Traits> using the d-dimensional CGAL kernel
|oCMin_annulus_dAn object of the class Min_annulus_d is the unique annulus (region between two concentric spheres with radii \( r\) and \( R\), \( r \leq R\)) enclosing a finite set of points in \( d\)-dimensional Euclidean space \( \E^d\), where the difference \( R^2-r^2\) is minimal
|oCMin_circle_2An object of the class Min_circle_2 is the unique circle of smallest area enclosing a finite (multi)set of points in two-dimensional Euclidean space \( \E^2\)
|oCMin_circle_2_traits_2The class Min_circle_2_traits_2 is a traits class for Min_circle_2<Traits> using the two-dimensional CGAL kernel
|oCMin_ellipse_2An object of the class Min_ellipse_2 is the unique ellipse of smallest area enclosing a finite (multi)set of points in two-dimensional euclidean space \( \E^2\)
|oCMin_ellipse_2_traits_2The class Min_ellipse_2_traits_2 is a traits class for CGAL::Min_ellipse_2<Traits> using the two-di-men-sional CGAL kernel
|oCMin_quadrilateral_default_traits_2The class Min_quadrilateral_default_traits_2 is a traits class for the functions min_rectangle_2, min_parallelogram_2 and min_strip_2 using a two-dimensional CGAL kernel
|oCMin_sphere_annulus_d_traits_2The class Min_sphere_annulus_d_traits_2 is a traits class for the \( d\)-dimensional optimisation algorithms using the two-dimensional CGAL kernel
|oCMin_sphere_annulus_d_traits_3The class Min_sphere_annulus_d_traits_3 is a traits class for the \( d\)-dimensional optimisation algorithms using the three-dimensional CGAL kernel
|oCMin_sphere_annulus_d_traits_dThe class Min_sphere_annulus_d_traits_d is a traits class for the \( d\)-dimensional optimisation algorithms using the \( d\)-dimensional CGAL kernel
|oCMin_sphere_dAn object of the class Min_sphere_d is the unique sphere of smallest volume enclosing a finite (multi)set of points in \( d\)-dimensional Euclidean space \( \E^d\)
|oCMin_sphere_of_points_d_traits_2The class Min_sphere_of_points_d_traits_2<K,FT,UseSqrt,Algorithm> is a model for concept MinSphereOfSpheresTraits
|oCMin_sphere_of_points_d_traits_3The class Min_sphere_of_points_d_traits_3<K,FT,UseSqrt,Algorithm> is a model for concept MinSphereOfSpheresTraits
|oCMin_sphere_of_points_d_traits_dThe class Min_sphere_of_points_d_traits_d<K,FT,Dim,UseSqrt,Algorithm> is a model for concept MinSphereOfSpheresTraits
|oCMin_sphere_of_spheres_dAn object of the class Min_sphere_of_spheres_d is a data structure that represents the unique sphere of smallest volume enclosing a finite set of spheres in \( d\)-dimensional Euclidean space \( \E^d\)
|oCMin_sphere_of_spheres_d_traits_2The class Min_sphere_of_spheres_d_traits_2<K,FT,UseSqrt,Algorithm> is a model for concept MinSphereOfSpheresTraits
|oCMin_sphere_of_spheres_d_traits_3The class Min_sphere_of_spheres_d_traits_3<K,FT,UseSqrt,Algorithm> is a model for concept MinSphereOfSpheresTraits
|oCMin_sphere_of_spheres_d_traits_dThe class Min_sphere_of_spheres_d_traits_d<K,FT,Dim,UseSqrt,Algorithm> is a model for concept MinSphereOfSpheresTraits
|\CRectangular_p_center_default_traits_2The class Rectangular_p_center_default_traits_2 defines types and operations needed to compute rectilinear \( p\)-centers of a planar point set using the function rectangular_p_center_2()
oCApproximateMinEllipsoid_d_Traits_dThis concept defines the requirements for traits classes of CGAL::Approximate_min_ellipsoid_d<Traits>
oCCircleAn 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\}\)
oCEllipseAn 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\)
oCMinCircle2TraitsThis concept defines the requirements for traits classes of CGAL::Min_circle_2<Traits>
oCMinEllipse2TraitsThis concept defines the requirements for traits classes of CGAL::Min_ellipse_2<Traits>
oCMinQuadrilateralTraits_2The 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
oCMinSphereAnnulusDTraitsThis concept defines the requirements for traits classes of \( d\)-dimensional min sphere and min annulus algorithms
oCMinSphereOfSpheresTraitsA model of concept MinSphereOfSpheresTraits must provide the following constants, types, predicates and operations
\CRectangularPCenterTraits_2The 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