Inserted: 28 jun 2005
Last Updated: 27 dec 2006
Journal: Journal of Convex Analysis
Fixed a set of finitely many segments in $R^d$ we look for a connected system of these segments whose convex hull has the greatest $d$-dimensional volume, solving the problem when $d$ and $d+1$ segments are considered. Some remarks about the analogous maximization problem on the set of the continuous and rectifiable curves with fixed length are also proposed.
Keywords: convex hull, system of segments