CGAL 4.4 - Optimal Distances: Concepts

$\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.4 - Optimal Distances

•All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages

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