Tight bounds on the maximal perimeter and the maximal width of convex small polygons

DOI10.1007/s10898-022-01181-9zbMath1500.52001arXiv2010.02490OpenAlexW3092123050MaRDI QIDQ2089891

Christian Bingane

Publication date: 24 October 2022

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

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

zbMATH Keywords

global optimizationpolygonsplanar geometrymaximal widthisodiametric problemsmaximal perimeter

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Nonconvex programming, global optimization (90C26) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (1)

Small polygons with large area

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Enumerating isodiametric and isoperimetric polygons
• A discrete isoperimetric problem
• The small octagon with longest perimeter
• Isoperimetric polygons of maximum width
• Most Reinhardt polygons are sporadic
• Sporadic Reinhardt polygons
• The small octagons of maximal width
• On convex polygons of maximal width
• Isodiametric problems for polygons
• Largest small polygons: a sequential convex optimization approach
• Branching and bounds tighteningtechniques for non-convex MINLP

This page was built for publication: Tight bounds on the maximal perimeter and the maximal width of convex small polygons