/// \defgroup PkgMinkowskiSum2Ref Reference Manual
/// \defgroup PkgMinkowskiSum2Concepts Concepts
/// \ingroup PkgMinkowskiSum2Ref


/*!
\addtogroup PkgMinkowskiSum2Ref
\cgalPkgDescriptionBegin{2D Minkowski Sums,PkgMinkowskiSum2}
\cgalPkgPicture{Minkowski_sum_2/fig/Minkowski_sum_2.png}
\cgalPkgSummaryBegin
\cgalPkgAuthors{Ron Wein, Alon Baram, Eyal Flato, Efi Fogel, Michael Hemmer, and Sebastian Morr}
\cgalPkgDesc{This package consists of functions that compute the Minkowski sum of two simple straight-edge polygons in the plane. It also contains functions for computing the Minkowski sum of a polygon and a disc, an operation known as <I>offsetting</I> or <I>dilating</I> a polygon. The package can compute the exact representation of the offset polygon, or provide a guaranteed approximation of the offset.}
\cgalPkgManuals{Chapter_2D_Minkowski_Sums,PkgMinkowskiSum2Ref}
\cgalPkgSummaryEnd
\cgalPkgShortInfoBegin
\cgalPkgSince{3.3}
\cgalPkgDependsOn{\ref PkgArrangementOnSurface2, \ref PkgAABBTree, \ref PkgTriangulation2}
\cgalPkgBib{cgal:w-rms2}
\cgalPkgLicense{\ref licensesGPL "GPL"}
\cgalPkgShortInfoEnd
\cgalPkgDescriptionEnd

This package consist of functions for computing the Minkowksi sum
of two polygons in the plane. Namely, given two polygons \f$ P,Q \in
\mathbb{R}^2\f$ it computes \f$ P \oplus Q = \left\{ p + q ~|~ p \in P,
q \in Q \right\}\f$.

In addition, the package also includes functions for offsetting a
polygon, namely computing its Minkowski sum with a disc of a given
radius, and for insetting a polygon (namely computing its inner
offset). It is possible to compute the exact representation of the
offset (or the inset), or to approximate it with guaranteed error
bounds, in order to speed up the computation time.

\cgalClassifedRefPages

\cgalCRPSection{Functions}
- `CGAL::minkowski_sum_2()`
- `CGAL::minkowski_sum_by_decomposition_2()`
- `CGAL::minkowski_sum_by_full_convolution_2()`
- `CGAL::minkowski_sum_by_reduced_convolution_2()`
- `CGAL::approximated_offset_2()`
- `CGAL::approximated_inset_2()`
- `CGAL::offset_polygon_2()`
- `CGAL::inset_polygon_2()`

\cgalCRPSection{Concepts}
- `PolygonConvexDecomposition_2`
- `PolygonWithHolesConvexDecomposition_2`

\cgalCRPSection{Classes}
- `CGAL::Small_side_angle_bisector_decomposition_2<Kernel,Container>`
- `CGAL::Optimal_convex_decomposition_2<Kernel,Container>`
- `CGAL::Hertel_Mehlhorn_convex_decomposition_2<Kernel,Container>`
- `CGAL::Greene_convex_decomposition_2<Kernel,Container>`
- `CGAL::Polygon_vertical_decomposition_2<Kernel,Container>`
- `CGAL::Polygon_triangulation_decomposition_2<Kernel,Container>`
- `CGAL::Polygon_nop_decomposition_2<Kernel,Container>`

*/
