Mathematics – Metric Geometry
Scientific paper
2009-12-19
Mathematics
Metric Geometry
13 pages, 2 figures. This version replaces the previous version from 29 Aug 2010
Scientific paper
Let $A_1,A_2,...,A_n$ be the vertices of a polygon with unit perimeter, that is $\sum_{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 Bra\ss\ regarding the maximum perimeter of a simple $n$-gon ($n$ odd) contained in a disk of unit radius. The problem was recently 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.
Dumitrescu Adrian
No associations
LandOfFree
Metric inequalities for polygons does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Metric inequalities for polygons, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Metric inequalities for polygons will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-382159