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]

▼NCGAL
CApproximate_min_ellipsoid_d	An 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\)
CApproximate_min_ellipsoid_d_traits_2	The class `Approximate_min_ellipsoid_d_traits_2` is a traits class for `CGAL::Approximate_min_ellipsoid_d<Traits>` using the 2-dimensional CGAL kernel
CApproximate_min_ellipsoid_d_traits_3	The class `Approximate_min_ellipsoid_d_traits_3` is a traits class for `CGAL::Approximate_min_ellipsoid_d<Traits>` using the 3-dimensional CGAL kernel
CApproximate_min_ellipsoid_d_traits_d	The class `Approximate_min_ellipsoid_d_traits_d` is a traits class for `CGAL::Approximate_min_ellipsoid_d<Traits>` using the d-dimensional CGAL kernel
CMin_annulus_d	An 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
CMin_circle_2	An 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\)
CMin_circle_2_traits_2	The class `Min_circle_2_traits_2` is a traits class for `Min_circle_2<Traits>` using the two-dimensional CGAL kernel
CMin_ellipse_2	An 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\)
CMin_ellipse_2_traits_2	The class `Min_ellipse_2_traits_2` is a traits class for `CGAL::Min_ellipse_2<Traits>` using the two-di-men-sional CGAL kernel
CMin_quadrilateral_default_traits_2	The 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
CMin_sphere_annulus_d_traits_2	The class `Min_sphere_annulus_d_traits_2` is a traits class for the \( d\)-dimensional optimisation algorithms using the two-dimensional CGAL kernel
CMin_sphere_annulus_d_traits_3	The class `Min_sphere_annulus_d_traits_3` is a traits class for the \( d\)-dimensional optimisation algorithms using the three-dimensional CGAL kernel
CMin_sphere_annulus_d_traits_d	The class `Min_sphere_annulus_d_traits_d` is a traits class for the \( d\)-dimensional optimisation algorithms using the \( d\)-dimensional CGAL kernel
CMin_sphere_d	An 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\)
CMin_sphere_of_points_d_traits_2	The class `Min_sphere_of_points_d_traits_2<K,FT,UseSqrt,Algorithm>` is a model for concept `MinSphereOfSpheresTraits`
CMin_sphere_of_points_d_traits_3	The class `Min_sphere_of_points_d_traits_3<K,FT,UseSqrt,Algorithm>` is a model for concept `MinSphereOfSpheresTraits`
CMin_sphere_of_points_d_traits_d	The class `Min_sphere_of_points_d_traits_d<K,FT,Dim,UseSqrt,Algorithm>` is a model for concept `MinSphereOfSpheresTraits`
CMin_sphere_of_spheres_d	An 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\)
CMin_sphere_of_spheres_d_traits_2	The class `Min_sphere_of_spheres_d_traits_2<K,FT,UseSqrt,Algorithm>` is a model for concept `MinSphereOfSpheresTraits`
CMin_sphere_of_spheres_d_traits_3	The class `Min_sphere_of_spheres_d_traits_3<K,FT,UseSqrt,Algorithm>` is a model for concept `MinSphereOfSpheresTraits`
CMin_sphere_of_spheres_d_traits_d	The class `Min_sphere_of_spheres_d_traits_d<K,FT,Dim,UseSqrt,Algorithm>` is a model for concept `MinSphereOfSpheresTraits`
CRectangular_p_center_default_traits_2	The 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()`
CApproximateMinEllipsoid_d_Traits_d	This concept defines the requirements for traits classes of `CGAL::Approximate_min_ellipsoid_d<Traits>`
CCircle	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\}\)
CEllipse	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\)
CMinCircle2Traits	This concept defines the requirements for traits classes of `CGAL::Min_circle_2<Traits>`
CMinEllipse2Traits	This concept defines the requirements for traits classes of `CGAL::Min_ellipse_2<Traits>`
CMinQuadrilateralTraits_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`
CMinSphereAnnulusDTraits	This concept defines the requirements for traits classes of \( d\)-dimensional min sphere and min annulus algorithms
CMinSphereOfSpheresTraits	A model of concept `MinSphereOfSpheresTraits` must provide the following constants, types, predicates and operations
CRectangularPCenterTraits_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`