Simple polygons of maximum perimeter contained in a unit disk
The authors define a \textit{simple polygon} in \(\mathbb{R}^2\) as a union of finitely many straight line segments which is homeomorphic to a circle. The paper is devoted to the following question from [\textit{P. Brass, W. Moser} and \textit{J. Pach}, Research problems in discrete geometry. (New York), NY: Springer. (2005; Zbl 1086.52001)], {p.~437}: Find the supremum of perimeters of simple \(n\)-sided polygons contained in the unit disk and find polygons for which it is almost attained. In the op cit it was mentioned that for even \(n\) the problem is trivial and the supremum is \(2n\). The main purpose of the paper is to show that for odd \(n\geq 5\) the close-to-optimal polygons are arbitrarily close to an isosceles triangle, and that for \(n=3\) the optimal solution is an equilateral triangle.
- QPLIB: a library of quadratic programming instances
- Upper bounds for the perimeter of plane convex bodies
- Metric inequalities for polygons
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- A $1 Problem
- On the perimeters of simple polygons contained in a plane convex body
- On the perimeters of simple polygons contained in a disk
- Maximum-area and maximum-perimeter rectangles in polygons
This page was built for publication: Simple polygons of maximum perimeter contained in a unit disk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1017919)
