Günter Rote:

The largest contained quadrilateral and the smallest enclosing parallelogram of a convex polygon

Preprint, June 2019, 11 pages, arXiv:1905.11203 [cs.CG],  →BibTeX

Abstract

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.

  pdf file
other papers about this subject
Last update: June 20, 2019.