Small polygons with large area

DOI10.1007/s10898-023-01329-1arXiv2204.04547OpenAlexW4387121580MaRDI QIDQ6123561

Christian Bingane, Michael J. Mossinghoff

Publication date: 5 April 2024

Published in: Journal of Global Optimization (Search for Journal in Brave)

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

zbMATH Keywords

polygonsisodiametric problemmaximal area

Mathematics Subject Classification ID

Polyhedra and polytopes; regular figures, division of spaces (51M20) Inequalities and extremum problems involving convexity in convex geometry (52A40) Length, area, volume and convex sets (aspects of convex geometry) (52A38)

Cites Work

• Unnamed Item
• The small octagon with longest perimeter
• The largest small hexagon
• The largest small octagon
• Using symbolic calculations to determine largest small polygons
• Tight bounds on the maximal perimeter and the maximal width of convex small polygons
• Finding largest small polygons with gloptipoly
• Diameter graphs of polygons and the proof of a conjecture of Graham
• Extremal problems for convex polygons
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Isodiametric problems for polygons
• Largest small polygons: a sequential convex optimization approach
• Tight bounds on the maximal area of small polygons: improved Mossinghoff polygons

This page was built for publication: Small polygons with large area