Datta, B
(1997)
*A discrete isoperimetric problem.*
In: Geometriae Dedicata, 64
(1).
pp. 55-68.

PDF
A_Discrete.pdf - Published Version Restricted to Registered users only Download (152Kb) | Request a copy |

Official URL: http://www.springerlink.com/content/w1133x82778747...

## Abstract

We prove that the perimeter of any convex n-gons of diameter 1 is at most 2n sin(pi/2n). Equality is attained here if and only if n has an odd factor. In the latter case, there are (up to congruence) only finitely many extremal n-gons. In fact, the convex n-gons of diameter I and perimeter 2n sin(pi/2n) are in bijective correspondence with the solutions of a diophantine problem.

Item Type: | Journal Article |
---|---|

Related URLs: | |

Additional Information: | Copyright of this article belongs to Springer. |

Keywords: | convex polygons;isoperimetric inequalities. |

Department/Centre: | Division of Physical & Mathematical Sciences > Mathematics |

Date Deposited: | 01 Jun 2009 06:50 |

Last Modified: | 19 Sep 2010 05:00 |

URI: | http://eprints.iisc.ernet.in/id/eprint/18236 |

### Actions (login required)

View Item |