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