I am looking to find code or a data flow diagram that will describe the process for finding the largest-area axis aligned rectangle inside a convex polygon.
I have looked at this post, and followed the suggested link to no avail.
To date, I have completed code for "2 corners on the boundary of P". I am stuck trying to complete the code for "3 corners on the boundary of P". My issue mainly lies inside the "Tentative Prune-and-Search" method described here.
