Maximum-Area Quadrilateral in a Convex Polygon, Revisited
arXiv:1708.00681
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.
6 pages. arXiv admin note: substantial text overlap with arXiv:1705.11035