Using symbolic calculations to determine largest small polygons

DOI10.1007/S10898-020-00908-WMaRDI QIDQ2046342zbMATH OpenOpenAlexFDO

Authors Charles Audet, Pierre Hansen, Dragutin Svrtan

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) Inequalities and extremum problems in real or complex geometry (51M16) Elementary problems in Euclidean geometries (51M04)

Recommendations

• Finding largest small polygons with gloptipoly
• Finding largest rectangles in convex polygons
• Finding the smallest triangles containing a given convex polygon
• Largest small polygons: a sequential convex optimization approach
• Computing area-optimal simple polygonizations
• Finding Extremal Polygons
• Computing the Smallest T-Shaped Polygon Containing k Points
• Maximal Area of Equilateral Small Polygons
• scientific article; zbMATH DE number 522850
• Finding minimal nested polygons

Cites work

• scientific article; zbMATH DE number 575960 (Why is no real title available?)
• scientific article; zbMATH DE number 5589231 (Why is no real title available?)
• Diameter graphs of polygons and the proof of a conjecture of Graham
• Extremal problems for convex polygons
• Finding largest small polygons with gloptipoly
• Isodiametric problems for polygons
• Maximal Area of Equilateral Small Polygons
• Polynomials with Height 1 and Prescribed Vanishing at 1
• Problem 7 and systems of algebraic equations
• Ranking small regular polygons by area and by perimeter
• The largest small hexagon
• The largest small octagon

Cited in

(6)

• Largest small polygons: a sequential convex optimization approach
• Finding largest small polygons with gloptipoly
• Numerical certification of Pareto optimality for biobjective nonlinear problems
• Extremal problems for spherical convex polygons
• Tight bounds on the maximal area of small polygons: improved Mossinghoff polygons
• Small polygons with large area

Describes a project that uses

Uses Software

• GloptiPoly

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

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