\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)

CGAL 4.3 - Inscribed Areas

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Class and Concept List
Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.
[detail level 1 2]

CGAL |
Extremal_polygon_area_traits_2 | This is an advanced class
Extremal_polygon_perimeter_traits_2 | This is an advanced class
Largest_empty_iso_rectangle_2 | Given a set of points in the plane, the class `Largest_empty_iso_rectangle_2` is a data structure that maintains an iso-rectangle with the largest area among all iso-rectangles that are inside a given bounding box( iso-rectangle), and that do not contain any point of the point set
ExtremalPolygonTraits_2 | Advanced The concept `ExtremalPolygonTraits_2` provides the types and operations needed to compute a maximal \( k\)-gon that can be inscribed into a given convex polygon.
LargestEmptyIsoRectangleTraits_2 | The concept `LargestEmptyIsoRectangleTraits_2` describes the set of requirements to be fulfilled by any class used to instantiate the template parameter of the class `Largest_empty_iso_rectangle_2<T>`. This concept provides the types of the geometric primitives used in this class and some function object types for the required predicates on those primitives