CGAL 6.1 - Inscribed Areas

Loading...
Searching...
No Matches
Classes | Functions
CGAL Namespace Reference

## Classes
struct | Extremal_polygon_area_traits_2
| This is an advanced class. More...
struct | Extremal_polygon_perimeter_traits_2
| This is an advanced class. More...
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. More...

## Functions
template<class RandomAccessIterator , class OutputIterator , class Traits >
OutputIterator | extremal_polygon_2 (RandomAccessIterator points_begin, RandomAccessIterator points_end, int k, OutputIterator o, const Traits &t)
| computes a maximal (as specified by `t`) inscribed `k`-gon of the convex polygon described by [`points_begin`, `points_end`), writes its vertices to `o` and returns the past-the-end iterator of this sequence.
template<class RandomAccessIterator , class OutputIterator >
OutputIterator | maximum_area_inscribed_k_gon_2 (RandomAccessIterator points_begin, RandomAccessIterator points_end, int k, OutputIterator o)
| computes a maximum area inscribed `k`-gon of the convex polygon described by [`points_begin`, `points_end`), writes its vertices to `o` and returns the past-the-end iterator of this sequence.
template<class RandomAccessIterator , class OutputIterator >
OutputIterator | maximum_perimeter_inscribed_k_gon_2 (RandomAccessIterator points_begin, RandomAccessIterator points_end, int k, OutputIterator o)
| computes a maximum perimeter inscribed `k`-gon of the convex polygon described by `[points_begin, points_end)`, writes its vertices to `o` and returns the past-the-end iterator of this sequence.