CGAL 6.1.1 - 2D Minkowski Sums

Loading...
Searching...
No Matches
CGAL::Polygon_vertical_decomposition_2< Kernel, Container > Class Template Reference
Reference Manual

`#include <CGAL/Polygon_vertical_decomposition_2.h>`

## Definition

template<typename Kernel, typename Container>
class CGAL::Polygon_vertical_decomposition_2< Kernel, Container >

The `Polygon_vertical_decomposition_2` class implements a convex decomposition 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`