Metric inequalities for polygons

DOI10.20382/JOCG.V4I1A4zbMATH Open1408.51020arXiv0912.3929OpenAlexW2963796874MaRDI QIDQ2968097FDOQ2968097

Adrian Dumitrescu

Publication date: 9 March 2017

Abstract: Let $A_1,A_2,\mathrm{...},A_n$ be the vertices of a polygon with unit perimeter, that is $su{m}_{i=1}^n|A_i{A}_{i+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 Brass 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. cite{AHM09b}, 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.

Full work available at URL: https://arxiv.org/abs/0912.3929

zbMATH Keywords

polygon\(n\)-gonmaximum perimeter

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Inequalities and extremum problems in real or complex geometry (51M16)

Cited In (3)

• Inequalities for convex cyclic polygons
• Metric properties of Poncelet polygonal lines
• A new metric between polygons, and how to compute it

This page was built for publication: Metric inequalities for polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2968097)