CGAL 5.0.2 - 2D Convex Hulls and Extreme Points: Concepts

Loading [MathJax]/extensions/TeX/newcommand.js

$\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 5.0.2 - 2D Convex Hulls and Extreme Points

•All Classes Namespaces Files Functions Variables Typedefs Enumerations Friends Modules Pages

Concepts
concept	ConvexHullTraits_2
	All convex hull and extreme point algorithms provided in CGAL are parameterized with a traits class `Traits`, which defines the primitives (objects and predicates) that the convex hull algorithms use. `ConvexHullTraits_2` defines the complete set of primitives required in these functions. The specific subset of these primitives required by each function is specified with each function. More...