2009/12/19 by Adrian Dumitrescu, Dumitrescu, Adrian
Computer Science · Mathematics · #Computational Geometry and Mesh Generation #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Mathematics and Applications #Metric Geometry (math.MG) #Point processes and geometric inequalities #cs.DM #math.MG
paper · pdf · doi:10.48550/arxiv.0912.3929
13 pages, 2 figures. This version replaces the previous version from 8 Feb 2011. A new section has been added and the material has been reorganized; a correction has been done in the proof of Lemma 4 (analysis of Case 3)
openalex publication_date 2009/12/19 · arxiv created 2012/06/21 · arxiv updated 2012/06/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let A1,A2,...,An be the vertices of a polygon with unit perimeter, that is ∑i=1n |Ai Ai+1|=1. We derive various tight estimates on the minimum and maximum values of the sum of pairwise distances, and respectively sum of pairwise squared distances among its vertices. In most cases such estimates on these sums in the literature were known only for convex polygons. In the second part, we turn to a problem of Braß regarding the maximum perimeter of a simple n-gon (n odd) contained in a disk of unit radius. The problem was solved by Audet et al. \citeAHM09b, who gave an exact formula. Here we present an alternative simpler proof of this formula. We then examine what happens if the simplicity condition is dropped, and obtain an exact formula for the maximum perimeter in this case as well.