The Worm Problem of Leo Moser
- First Online:
- Cite this article as:
- Norwood, R., Poole, G. & Laidacker, M. Discrete Comput Geom (1992) 7: 153. doi:10.1007/BF02187832
- 169 Downloads
One of Leo Moser's geometry problems is referred to as the Worm Problem : “What is the (convex) region of smallest area which will accommodate (or cover) every planar arc of length 1?” For example, it is easy to show that the circular disk with diameter 1 will cover every planar arc of length 1. The area of the disk is approximately 0.78539. Here we show that a solution to the Worm Problem of Moser is a region with area less than 0.27524.