CGAL 6.1 - 2D Minkowski Sums
|
#include <Concepts/PolygonWithHolesConvexDecomposition_2.h>
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\).
PolygonConvexDecomposition_2
CGAL::Polygon_vertical_decomposition_2<Kernel,Container>
CGAL::Polygon_triangulation_decomposition_2<Kernel,Container>
Types | |
typedef unspecified_type | Polygon_with_holes_2 |
the polygon with holes type, defined as Polygon_with_holes_2<Kernel,Container> . | |
Creation | |
PolygonWithHolesConvexDecomposition_2 () | |
default constructor. | |
Operations | |
template<class OutputIterator > | |
OutputIterator | operator() (const Polygon_with_holes_2 &P, OutputIterator oi) const |
decomposes the input polygon with holes P into convex sub-polygons, and writes them to the output iterator oi . | |
typedef unspecified_type PolygonWithHolesConvexDecomposition_2::Polygon_with_holes_2 |
the polygon with holes type, defined as Polygon_with_holes_2<Kernel,Container>
.
PolygonWithHolesConvexDecomposition_2::PolygonWithHolesConvexDecomposition_2 | ( | ) |
default constructor.
OutputIterator PolygonWithHolesConvexDecomposition_2::operator() | ( | const Polygon_with_holes_2 & | P, |
OutputIterator | oi | ||
) | const |
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.