CGAL 4.7 - 2D Minkowski Sums
CGAL::Greene_convex_decomposition_2< Kernel, Container > Class Template Reference

#include <CGAL/Polygon_convex_decomposition_2.h>

## Definition

The Greene_convex_decomposition_2 class implements the approximation algorithm of Greene for the decomposition of an input polygon into convex sub-polygons [5]. This algorithm takes $$O(n \log n)$$ time and $$O(n)$$ space, where $$n$$ is the size of the input polygon, and outputs a decomposition whose size is guaranteed to be no more than four times the size of the optimal decomposition.

Template Parameters
 Kernel must be a geometric kernel that can be used for the polygon. Container must be a container that can be used for the polygon. It is by default std::vector.
Is Model Of:
PolygonConvexDecomposition_2
CGAL::greene_approx_convex_partition_2()