Lebesgue universal covering problem

Lebesgues universal covering problem asks for the convex shape of smallest area that can cover¹ any planar set of diameter one that is the least upper bound of the distances between all pairs of points in the set The problem was posed by ...