An algorithm to find maximum area polygons circumscribed about a convex polygon
Metric Geometry
2024-03-25 v4 Combinatorics
Abstract
A convex polygon Q is circumscribed about a convex polygon P if every vertex of P lies on at least one side of Q. We present an algorithm for finding a maximum area convex polygon circumscribed about any given convex n-gon in O(n^3) time. As an application, we disprove a conjecture of Farris. Moreover, for the special case of regular n-gons we find an explicit solution.
Cite
@article{arxiv.1706.08152,
title = {An algorithm to find maximum area polygons circumscribed about a convex polygon},
author = {Markus Ausserhofer and Susanna Dann and Zsolt Lángi and Géza Tóth},
journal= {arXiv preprint arXiv:1706.08152},
year = {2024}
}
Comments
In this version we correct an error in Theorem 4 of the published version