A Dido problem as modernized by Fejes Tóth (Q1597667): Difference between revisions

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.