An improved upper bound for Leo Moser's worm problem

DOI10.1007/s00454-002-0774-3zbMath1028.52001OpenAlexW2055396042MaRDI QIDQ1404509

Rick Norwood, George D. Poole

Publication date: 21 August 2003

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-002-0774-3

zbMATH Keywords

coverworm problem

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (8)

LOWER BOUND FOR CONVEX HULL AREA AND UNIVERSAL COVER PROBLEMS ⋮ Universal convex covering problems under translations and discrete rotations ⋮ A convex cover for closed unit curves has area at least 0.1 ⋮ Covers for closed curves of length two ⋮ Curve packing and modulus estimates ⋮ Shortest closed curve to inspect a sphere ⋮ A Convex Cover for Closed Unit Curves has Area at Least 0.0975 ⋮ Nonconvex cases for carpenter's rulers

This page was built for publication: An improved upper bound for Leo Moser's worm problem