Tight bounds on the maximal area of small polygons: improved Mossinghoff polygons

From MaRDI portal
Publication:6156093

DOI10.1007/S00454-022-00374-ZzbMATH Open1516.52001arXiv2110.11741MaRDI QIDQ6156093FDOQ6156093


Authors: Christian Bingane Edit this on Wikidata


Publication date: 12 June 2023

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: A small polygon is a polygon of unit diameter. The maximal area of a small polygon with n=2m vertices is not known when mge7. In this paper, we construct, for each n=2m and mge3, a small n-gon whose area is the maximal value of a one-variable function. We show that, for all even nge6, the area obtained improves by O(1/n5) that of the best prior small n-gon constructed by Mossinghoff. In particular, for n=6, the small 6-gon constructed has maximal area.


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




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Tight bounds on the maximal area of small polygons: improved Mossinghoff polygons

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