An Upper Bound for Lebesgue's Covering Problem

arXiv1810.10089MaRDI QIDQ6308684FDOQ6308684

Authors: Philip E. Gibbs 

Publication date: 23 October 2018

Abstract: 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.

This page was built for publication: An Upper Bound for Lebesgue's Covering Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6308684)