\( \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.org
Top
Getting Started
Organization of the Manual
Package Overview
Acknowledging CGAL
CGAL 4.6.1 - 2D Minkowski Sums
All
Classes
Namespaces
Files
Functions
Variables
Typedefs
Enumerations
Enumerator
Groups
Pages
Class and Concept List
Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.
[detail level
1
2
]
CGAL
Greene_convex_decomposition_2
Hertel_Mehlhorn_convex_decomposition_2
Optimal_convex_decomposition_2
Small_side_angle_bisector_decomposition_2
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\)