The Largest Contained Quadrilateral and the Smallest Enclosing Parallelogram of a Convex Polygon

05/27/2019
by   Günter Rote, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset