An Upper Bound for Lebesgue's Covering Problem

Add to the Conversation


A covering problem posed by Henri Lebesgue in 1914 seeks to find the convex shape of smallest area that contains a subset congruent to any point set of unit diameter in the Euclidean plane.  Methods used previously to construct such a covering can be refined and extended to provide an improved upper bound for the optimal area. An upper bound of 0.8440935944 is found.


➤  Version 1 (2019-08-01)


Philip Gibbs (2019). An Upper Bound for Lebesgue's Covering Problem. Researchers.One,

© 2018-2020 Researchers.One