The Largest Contained Quadrilateral and the Smallest Enclosing Parallelogram of a Convex Polygon
Günter Rote · arXiv (Cornell University) · 2019
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.