2000 character limit reached
The Largest Contained Quadrilateral and the Smallest Enclosing Parallelogram of a Convex Polygon
Published 27 May 2019 in cs.CG | (1905.11203v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.