Maximum-Area Quadrilateral in a Convex Polygon, Revisited

2017/08/02 by Vahideh Keikha, Maarten Löffler, Keikha, Vahideh +7
Computer Science · Mathematics · #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #FOS: Computer and information sciences #Mathematics and Applications #Point processes and geometric inequalities

paper · pdf · doi:10.48550/arxiv.1708.00681

openalex publication_date 2017/08/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this note we show by example that the algorithm presented in 1979 by Dobkin and Snyder for finding the largest-area k-gon that is inscribed in a convex polygon fails to find the optimal solution for k=4. This question, posed by Keikha et al. where they showed that the Dobkin Snyder algorithm fails for k=3.

Related

• The Largest Contained Quadrilateral and the Smallest Enclosing\n Parallelogram of a Convex Polygon
• An algorithm to find maximum area polygons circumscribed about a convex\n polygon
• A linear-time algorithm for the maximum-area inscribed triangle in a convex polygon
• Finding all Maximal Area Parallelograms in a Convex Polygon
• On the maximum area of inscribed polygons