A LOWER BOUND FOR LEBESGUE'S UNIVERSAL COVER PROBLEM
From MaRDI portal
Publication:5709140
DOI10.1142/S0218195905001828zbMath1088.52002WikidataQ59442951 ScholiaQ59442951MaRDI QIDQ5709140
Publication date: 29 November 2005
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195905001828
52A10: Convex sets in (2) dimensions (including convex curves)
Related Items
A Convex Cover for Closed Unit Curves has Area at Least 0.0975, Smallest universal covers for families of triangles, A convex cover for closed unit curves has area at least 0.1, Nonconvex cases for carpenter's rulers, Open sets avoiding integral distances, Maximum overlap and minimum convex hull of two convex polyhedra under translations, LOWER BOUND FOR CONVEX HULL AREA AND UNIVERSAL COVER PROBLEMS
Cites Work