CGAL 5.4.4 - 2D Minkowski Sums
|
#include <CGAL/Polygon_vertical_decomposition_2.h>
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.