An exact hierarchy for Lebesgue's universal covering constant and a certified 0.834 lower bound

Shuai Zeng

Posed by Lebesgue in 1914, the universal covering problem asks for the smallest-area planar convex set containing a congruent copy of every set of diameter at most one. We introduc…