A Dido problem as modernized by Fejes Tóth
The solution of Dido's problem for polygons says that among all open convex paths of finite segments with given lengths, those whose convex hull includes the greatest possible area are obtained by inscribing the path in a semicircle of suitable minimum radius. In a previous paper [Elem. Math. 56, 17-20 (2001; Zbl 0988.52012)] the author proved that the above configurations are optimal within the larger class of paths, non necessarily convex, which are connected as point-sets. Here he obtains the following more general result: For any set \(E\) of finite segments in the Euclidean plane \(\mathbb{R}^2\) the area of the closure of the union of the bounded components of \(\mathbb{R}^2\setminus E\) is maximal when the arrangement of the segments defines a polygon inscribed in a circle of suitable minimum radius. This interesting result answers a modern version of the Dido problem formulated by Fejes Tóth and Hajós.
- A problem of Fejes L. Tóth
- Optimal control solutions to the maximum volume isoperimetric pillars problem
- Small deformations of polygons and polyhedra
- Dido's problem and its impact on modern mathematics
- Isoperimetric inequalities for convex hulls and related questions
- scientific article; zbMATH DE number 1435935 (Why is no real title available?)
- On the oldest problem in the calculus of variations: a new message from Queen Dido
- Some Dido-type inequalities
- Dido's problem and beyond
- Thomas Simpson and Dido’s problem
This page was built for publication: A Dido problem as modernized by Fejes Tóth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1597667)
