[GRASS-dev] get largest region within an irregular polygon

[Moritz Lennert]

Hello,

In the context of trying to automatize certain procedures, we are 
looking for a way to identify the largest region (i.e. rectangle) 
completely comprised within an irregular polygon.

Has anyone ever approached such a problem ? Or maybe even found a 
solution in GRASS ?

The only algorithm I've found so far is:

http://cgm.cs.mcgill.ca/~athens/cs507/Projects/2003/DanielSud/

and its references, but I wondered if anyone had already done this, 
before we possibly try to delve into that matter more deeply.

Moritz