The Optimal_convex_decomposition_2 class provides an implementation of Greene's dynamic programming algorithm for optimal decomposition of a polygon into convex sub-polygons [4]. Note that this algorithm requires $O(n^4)$ time and $O(n^3)$ space in the worst case, where $n$ is the size of the input polygon.

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<typename Kernel::Point_2>.

Is Model Of:

PolygonConvexDecomposition_2

See Also

CGAL::optimal_convex_partition_2()