Metric inequalities for polygons
From MaRDI portal
Publication:2968097
Abstract: Let be the vertices of a polygon with unit perimeter, that is . 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 -gon ( 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.
Recommendations
- The Sum of Distances Between Vertices of a Convex Polygon with Unit Perimeter
- On the perimeters of simple polygons contained in a disk
- Simple polygons of maximum perimeter contained in a unit disk
- A convex polygon with small sum of squared distances between its vertices
- scientific article; zbMATH DE number 762250
Cited in
(7)- A convex polygon with small sum of squared distances between its vertices
- The Sum of Distances Between Vertices of a Convex Polygon with Unit Perimeter
- Inequalities for convex cyclic polygons
- Simple polygons of maximum perimeter contained in a unit disk
- Metric properties of Poncelet polygonal lines
- A new metric between polygons, and how to compute it
- On the perimeters of simple polygons contained in a disk
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)