2 papers
math.OC2024
A zonogon approach for computing small polygons of maximum perimeter
Bernd Mulansky, Andreas Potschka
We derive a mixed integer nonlinear programming formulation for the problem of finding a convex polygon with a given number of vertices that is small (diameter at most one) and has…
math.MG2022
The longest perimeter small triacontadigon
Bernd Mulansky, Andreas Potschka
We showcase a small triacontadigon, i.e. a convex -gon of unit diameter, with perimeter , which improves on all examples available so far.