A LOWER BOUND FOR LEBESGUE'S UNIVERSAL COVER PROBLEM

DOI10.1142/S0218195905001828zbMath1088.52002OpenAlexW2172249426WikidataQ59442951 ScholiaQ59442951MaRDI QIDQ5709140

Mehrbod Sharifi, Peter Brass

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

zbMATH Keywords

minimum area of a convex set in the plane

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (7)

Smallest universal covers for families of triangles ⋮ LOWER BOUND FOR CONVEX HULL AREA AND UNIVERSAL COVER PROBLEMS ⋮ Open sets avoiding integral distances ⋮ A convex cover for closed unit curves has area at least 0.1 ⋮ Maximum overlap and minimum convex hull of two convex polyhedra under translations ⋮ A Convex Cover for Closed Unit Curves has Area at Least 0.0975 ⋮ Nonconvex cases for carpenter's rulers

Cites Work

• Generalized breadths, circular Cantor sets, and the least area UCC
• Minimal universal covers in \(E^ n\)

This page was built for publication: A LOWER BOUND FOR LEBESGUE'S UNIVERSAL COVER PROBLEM