Question: Clever cutter 2

Let a convex polygon, for example Q:=polygon([[0,2],[1,4],[4,4],[5,1],[3,0]]), be given.
How to find the rectangle of the biggest area which is contained in Q?
A procedure is required. This problem seems to be more complex than the previous one.

Please Wait...