CGAL 4.9 - 2D Minkowski Sums: 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.9 - 2D Minkowski Sums

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

Concepts
concept	PolygonConvexDecomposition_2
	A model of the `PolygonConvexDecomposition_2` concept is capable of decomposing an input polygon $P$ into a set of convex sub-polygons $P_1, \ldots, P_k$ , such that $\cup_{i=1}^{k}{P_k} = P$ . More...

concept	PolygonWithHolesConvexDecomposition_2
	A model of the `PolygonWithHolesConvexDecomposition_2` concept is capable of decomposing an input polygon $P$ , which may have holes, into a set of convex sub-polygons $P_1, \ldots, P_k$ , such that $\cup_{i=1}^{k}{P_k} = P$ . More...