/// \defgroup PkgInscribedAreasRef Inscribed Areas Reference

/// \defgroup PkgInscribedAreasConcepts Concepts
/// \ingroup PkgInscribedAreasRef

/*!
\addtogroup PkgInscribedAreasRef
\todo check generated documentation
\cgalPkgDescriptionBegin{Inscribed Areas,PkgInscribedAreas}
\cgalPkgPicture{ler-detail.png}
\cgalPkgSummaryBegin
\cgalPkgAuthors{Michael Hoffmann and Eli Packer}
\cgalPkgDesc{This package provides algorithms for computing inscribed areas. The algorithms for computing inscribed areas are: the largest inscribed k-gon (area or perimeter) of a convex point set and the largest inscribed iso-rectangle.}
\cgalPkgManuals{Chapter_Inscribed_Areas,PkgInscribedAreasRef}
\cgalPkgSummaryEnd
\cgalPkgShortInfoBegin
\cgalPkgSince{1.1}
\cgalPkgBib{cgal:hp-ia}
\cgalPkgLicense{\ref licensesGPL "GPL"}
\cgalPkgDemo{2D Inscribed k-gon as part of Polygon demo,polygon.zip,2D Largest Empty Rectangle,largest_empty_rect_2.zip}
\cgalPkgShortInfoEnd
\cgalPkgDescriptionEnd


\cgalCRPSection{Assertions}

The optimization code uses infix `OPTIMISATION` in the assertions,
e.g. defining the compiler flag
`CGAL_OPTIMISATION_NO_PRECONDITIONS` switches precondition
checking off, cf. Section  \ref secchecks.

\cgalClassifedRefPages

- `CGAL::maximum_area_inscribed_k_gon_2`
- `CGAL::maximum_perimeter_inscribed_k_gon_2`
- `CGAL::extremal_polygon_2`
- `CGAL::Largest_empty_iso_rectangle_2<T>`
- `CGAL::Extremal_polygon_area_traits_2<K>`
- `CGAL::Extremal_polygon_perimeter_traits_2<K>`
- `ExtremalPolygonTraits_2`
- `LargestEmptyIsoRectangleTraits_2`

*/

