Skip to main content
Log in

On convex polygons of maximal width

  • Published:
Archiv der Mathematik Aims and scope Submit manuscript

Abstract.

In this paper we consider the problem of finding the n-sided (\(n\geq 3\)) polygons of diameter 1 which have the largest possible width w n . We prove that \(w_4=w_3= {\sqrt 3 \over 2}\) and, in general, \(w_n \leq \cos {\pi \over 2n}\). Equality holds if n has an odd divisor greater than 1 and in this case a polygon \(\cal P\) is extremal if and only if it has equal sides and it is inscribed in a Reuleaux polygon of constant width 1, such that the vertices of the Reuleaux polygon are also vertices of \(\cal P\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: 9.10.1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bezdek, A., Fodor, F. On convex polygons of maximal width. Arch. Math. 74, 75–80 (2000). https://doi.org/10.1007/PL00000413

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00000413

Keywords

Navigation