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]

CGAL
Polytope_distance_d	An object of the class `Polytope_distance_d` represents the (squared) distance between two convex polytopes, given as the convex hulls of two finite point sets in $d$ -dimensional Euclidean space $\E^d$
Polytope_distance_d_traits_2	The class `Polytope_distance_d_traits_2` is a traits class for the $d$ -dimensional optimisation algorithms using the two-dimensional CGAL kernel
Polytope_distance_d_traits_3	The class `Polytope_distance_d_traits_3` is a traits class for the $d$ -dimensional optimisation algorithms using the three-dimensional CGAL kernel
Polytope_distance_d_traits_d	The class `Polytope_distance_d_traits_d` is a traits class for the $d$ -dimensional optimisation algorithms using the $d$ -dimensional CGAL kernel
Width_3	Given a set of points $\mathcal{S}=\left\{p_1,\ldots , p_n\right\}$ in $\mathbb{R}^3$
Width_default_traits_3	The class `Width_default_traits_3` is a traits class for `Width_3<Traits>` using the three-dimensional CGAL kernel
AllFurthestNeighborsTraits_2	The concept `AllFurthestNeighborsTraits_2` defines types and operations needed to compute all furthest neighbors for the vertices of a convex polygon using the function `all_furthest_neighbors_2()`
PolytopeDistanceDTraits	This concept defines the requirements for traits classes of $d$ -dimensional optimisation algorithms
WidthTraits_3	This concept defines the requirements for traits classes of `Width_3<Traits>`