CGAL 5.1.1  2D Minkowski Sums

#include <CGAL/Polygon_convex_decomposition_2.h>
The Greene_convex_decomposition_2
class implements the approximation algorithm of Greene for the decomposition of an input polygon into convex subpolygons [6].
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.
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> . 
Public Types  
typedef CGAL::Polygon_2< Kernel, Container >  Polygon_2 