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]

▼NCGAL
CPolytope_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$
CPolytope_distance_d_traits_2	The class Polytope_distance_d_traits_2 is a traits class for the $d$-dimensional optimization algorithms using the two-dimensional CGAL kernel
CPolytope_distance_d_traits_3	The class Polytope_distance_d_traits_3 is a traits class for the $d$-dimensional optimization algorithms using the three-dimensional CGAL kernel
CPolytope_distance_d_traits_d	The class Polytope_distance_d_traits_d is a traits class for the $d$-dimensional optimization algorithms using the $d$-dimensional CGAL kernel
CWidth_3	Given a set of points $\mathcal{S}=\left\{p_1,\ldots , p_n\right\}$ in $\mathbb{R}^3$
CWidth_default_traits_3	The class Width_default_traits_3 is a traits class for Width_3<Traits> using the three-dimensional CGAL kernel
CAllFurthestNeighborsTraits_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()
CPolytopeDistanceDTraits	This concept defines the requirements for traits classes of $d$-dimensional optimization algorithms
CWidthTraits_3	This concept defines the requirements for traits classes of Width_3<Traits>