arXiv · 1706.08152
An algorithm to find maximum area polygons circumscribed about a convex polygon
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.
Explore related subjects
Keep this discovery
Markus Ausserhofer, Susanna Dann, Zsolt Lángi, Géza Tóth. 2017-06-25. An algorithm to find maximum area polygons circumscribed about a convex polygon. https://arxiv.org/abs/1706.08152
Cite the original work for its findings. Save a collection to share your selection of sources.