A LOWER BOUND FOR LEBESGUE'S UNIVERSAL COVER PROBLEM

DOI10.1142/S0218195905001828MaRDI QIDQ5709140zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

minimum area of a convex set in the plane

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(13)

• A minimal Lebesgue covering exists
• Small universal covers for sets of unit diameter
• Generalized breadths, circular Cantor sets, and the least area UCC
• 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
• On universal covers in normed planes
• A convex cover for closed unit curves has area at least 0.0975
• A smaller sleeping bag for a baby snake
• Universal convex covering problems under translations and discrete rotations
• Smallest universal covers for families of triangles

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)