A model of the PolygonWithHolesConvexDecomposition_2 concept is capable of decomposing an input polygon \( P\), which may have holes, into a set of convex sub-polygons \( P_1, \ldots, P_k\), such that \( \cup_{i=1}^{k}{P_k} = P\).
- Refines
PolygonConvexDecomposition_2
- Has models
CGAL::Polygon_vertical_decomposition_2<Kernel,Container>
CGAL::Polygon_triangulation_decomposition_2<Kernel,Container>
|
|
| PolygonWithHolesConvexDecomposition_2 () |
| | default constructor.
|
| |
◆ operator()()
decomposes the input polygon with holes P into convex sub-polygons, and writes them to the output iterator oi.
The value-type of the output iterator must be Polygon_2. The function returns a past-the-end iterator for the convex sub-polygons.