\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.10.1 - Optimal Distances
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Classes
Concepts
Optimal Distances Reference

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