CGAL 4.7 - Optimal Distances

## Concepts

conceptAllFurthestNeighborsTraits_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...

conceptPolytopeDistanceDTraits
This concept defines the requirements for traits classes of $$d$$-dimensional optimisation algorithms. More...

conceptWidthTraits_3
This concept defines the requirements for traits classes of Width_3<Traits>. More...