An Improved Upper Bound for Leo Moser's Worm Problem
Document Type
Review
Publication Date
1-1-2003
Description
A worm ω is a continuous rectifiable arc of unit length in the Cartesian plane. Let W denote the class of all worms. A planar region C is called a cover for W if it contains a copy of every worm in W. That is, C will cover or contain any member ω of W after an appropriate translation and/or rotation of ω is completed (no reflections). The open problem of determining a cover C of smallest area is attributed to Leo Moser [7], [8]. This paper reduces the smallest known upper bound for this area from 0.275237 [10] to 0.260437.
Citation Information
Norwood, Rick; and Poole, George. 2003. An Improved Upper Bound for Leo Moser's Worm Problem. Discrete and Computational Geometry. Vol.29(3). 409-417. https://doi.org/10.1007/s00454-002-0774-3 ISSN: 0179-5376