The words contained in this file might help you see if this file matches what you are looking for:

...Discrete comput geom computational geometry sprmger verlag new york inc the worm problem of leo moser rick norwood george poole and michael laidacker a east tennessee state university johnson city tn usa lamar beaumont tx abstract one s problems is referred to as what convex region smallest area which will accommodate or cover every planar arc length for example it easy show that circular disk with diameter approximately here we solution less than introduction some years ago produced published list see also open questions in entitled poorly formulated unsolved combinatorial number an alternate way describe this size shape flat surface minimum can be used hammer head upon strategically striking any given smash simultaneously from stem stern unpublished paper using blaschke selection theorem shown indeed has there however not necessarily unique section below furthermore been noted must exceed consequently lies between progress toward leading up current result presented contains proof req...