Tight bounds on the maximal area of small polygons: improved Mossinghoff polygons
DOI10.1007/S00454-022-00374-ZzbMATH Open1516.52001arXiv2110.11741MaRDI QIDQ6156093FDOQ6156093
Authors: Christian Bingane
Publication date: 12 June 2023
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.11741
Recommendations
- Tight bounds on the maximal perimeter and the maximal width of convex small polygons
- Tight bounds on the maximal perimeter of convex equilateral small polygons
- Isodiametric problems for polygons
- The equilateral small octagon of maximal width
- Using symbolic calculations to determine largest small polygons
Length, area, volume and convex sets (aspects of convex geometry) (52A38) Convex sets in (2) dimensions (including convex curves) (52A10) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Cites Work
- The largest small hexagon
- The largest small octagon
- Isodiametric problems for polygons
- Finding largest small polygons with gloptipoly
- Diameter graphs of polygons and the proof of a conjecture of Graham
- Maximal Area of Equilateral Small Polygons
- The equilateral small octagon of maximal width
- Ranking small regular polygons by area and by perimeter
Cited In (6)
- Ranking small regular polygons by area and by perimeter
- Tight bounds on the maximal perimeter of convex equilateral small polygons
- Largest small polygons: a sequential convex optimization approach
- The equilateral small octagon of maximal width
- Tight bounds on the maximal perimeter and the maximal width of convex small polygons
- Small polygons with large area
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)