On the perimeters of simple polygons contained in a disk

preprint2010arXivOpen access

Abstract

A simple nn-gon is a polygon with nn 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≥5n \geq 5 odd, what is the maximum perimeter of a simple nn-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 this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.