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 4.13 - 2D Minkowski Sums
•All Classes Namespaces Files Functions Variables Typedefs Enumerations Friends Modules Pages
CGAL::Polygon_vertical_decomposition_2< Kernel, Container > Class Template Reference
2D Minkowski Sums Reference

#include <CGAL/Polygon_vertical_decomposition_2.h>

Definition

The Polygon_vertical_decomposition_2 class implements a convex decompistion of a polygon or a polygon with holes into pseudo trapezoids utilizing the CGAL::decompose() free function of the 2D Arrangements package.

The algorithm operates in O(n \log n) time and takes O(n) space at the worst case, where n is the size of the input polygon.

Is Model Of:
PolygonWithHolesConvexDecomposition_2