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.
The algorithms are given in pseudocode in Appendices A–C, and they have been implemented in Python.
Last update: June 20, 2019.