arXiv · 1002.3922
On the perimeters of simple polygons contained in a disk
Abstract
A simple $n$-gon is a polygon with $n$ edges with each vertex belonging to exactly two edges and every other point belonging to at most one edge. Brass asked the following question: For $n \geq 5$ odd, what is the maximum perimeter of a simple $n$-gon contained in a Euclidean unit disk? In 2009, Audet, Hansen and Messine answered this question, and showed that the optimal configuration is an isosceles triangle with a multiple edge, inscribed in the disk. In this note we give a shorter and simpler proof of their result, which we generalize also for hyperbolic disks, and for spherical disks of sufficiently small radii.
Explore related subjects
Keep this discovery
Zsolt Langi. 2010-02-20. On the perimeters of simple polygons contained in a disk. https://doi.org/10.1007/s00605-010-0214-z
Cite the original work for its findings. Save a collection to share your selection of sources.