CGAL users discussion list

[Stefan Funck <>]

Hi Michael,


Michael Hoffmann schrieb:
> 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.

thank you for your quick reply.
In other words: If I'd like to find the largest iso-rectangle within a convex
polygon, I have to "simulate" this polygon by a "dense" set of points (say 1
pixel distance) along the polygons edges?
Assuming the polygon is within an HD-image, the required number of points for
its representation may easily reach 5000 or more. What about computation time
then, is it still expected to be below say 1/100th of a second?

Many thanks,  Stefan