A LOWER BOUND FOR LEBESGUE'S UNIVERSAL COVER PROBLEM

DOI10.1142/S0218195905001828zbMATH Open1088.52002OpenAlexW2172249426WikidataQ59442951 ScholiaQ59442951MaRDI QIDQ5709140FDOQ5709140

Authors: 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

Recommendations

• The Lebesgue universal covering problem
• Small universal covers for sets of unit diameter
• Quermass-integrals of centro-symmetric universal covers
• Lower bound for convex hull area and universal cover problems
• Generalized breadths, circular Cantor sets, and the least area UCC

zbMATH Keywords

minimum area of a convex set in the plane

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (11)

• A convex cover for closed unit curves has area at least 0.1
• Smallest universal covers for families of triangles
• A minimal Lebesgue covering exists
• On universal covers in normed planes
• Nonconvex cases for carpenter's rulers
• 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
• Open sets avoiding integral distances
• Generalized breadths, circular Cantor sets, and the least area UCC
• LOWER BOUND FOR CONVEX HULL AREA AND UNIVERSAL COVER PROBLEMS
• A smaller sleeping bag for a baby snake

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

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