first of all, sorry for my bad english.
I'm trying to solve this problem: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=760
I already found the minimum area enclosing rectangle with the help of this information: http://cgm.cs.mcgill.ca/~orm/maer.html
It uses this statement to make the algorithm: The minimum area rectangle enclosing a convex polygon P has a side collinear with an edge of the polygon.
Now, I have to find the "maximum area" enclosing rectangle that fit tightly to the polygon, but I have no idea what kind of property to apply to do so.
Thank you for the attention.