We present a simple linear-time algorithm for finding the quadrilateral of largest area contained in  a convex polygon.
We present a linear-time algorithm for finding the quadrilateral of largest area contained in a convex polygon, and we show that it is closely related to an old algorithm for the smallest enclosing parallelogram of a convex polygon.
D
simple
A
a convex polygon, and we show that it is closely related to an old algorithm for the smallest enclosing parallelogram of