CGAL users discussion list

[Michael Hoffmann <>]

Hi Stefan,

> The documentation in Chapter 55 (Inscribed Areas) states: "We
> further provide an algorithm for computing the maximal area
> inscribed axis parallel rectangle."
>
> I just can't find any such function. Where is it to be found?

the following paragraph states it. It's not a function, though, it is
implemented as a data structure called
CGAL::Largest_empty_iso_rectangle_2<T>.

The smallest enclosing rectangle, otoh, can be found using
CGAL::min_rectangle_2, cf. Section 52 on Bounding Volumes.

hth,
Michael