Using symbolic calculations to determine largest small polygons

DOI10.1007/s10898-020-00908-wzbMath1480.51006OpenAlexW3023082283MaRDI QIDQ2046342

Dragutin Svrtan, Charles Audet, Pierre Hansen

Publication date: 17 August 2021

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

Full work available at URL: https://doi.org/10.1007/s10898-020-00908-w

zbMATH Keywords

planar geometrydisciminantsmall polygons

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Inequalities and extremum problems involving convexity in convex geometry (52A40) Elementary problems in Euclidean geometries (51M04) Inequalities and extremum problems in real or complex geometry (51M16)

Related Items (4)

Extremal problems for spherical convex polygons ⋮ Numerical certification of Pareto optimality for biobjective nonlinear problems ⋮ Small polygons with large area ⋮ Largest small polygons: a sequential convex optimization approach

Uses Software

• GloptiPoly

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The largest small hexagon
• The largest small octagon
• Finding largest small polygons with gloptipoly
• Diameter graphs of polygons and the proof of a conjecture of Graham
• Extremal problems for convex polygons
• Isodiametric problems for polygons
• Problem 7 and systems of algebraic equations
• Polynomials with Height 1 and Prescribed Vanishing at 1
• Maximal Area of Equilateral Small Polygons

This page was built for publication: Using symbolic calculations to determine largest small polygons