CGAL 5.1.2 - Optimal Distances
|
Concepts | |
concept | 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() . More... | |
concept | PolytopeDistanceDTraits |
This concept defines the requirements for traits classes of \( d\)-dimensional optimisation algorithms. More... | |
concept | WidthTraits_3 |
This concept defines the requirements for traits classes of Width_3<Traits> . More... | |