Paper Type |
Contributed Paper |
Title |
A Smaller Cover of the Moser’s Worm Problem |
Author |
Nattapol Ploymaklam and Wacharin Wichiramala |
Email |
wacharin.w@chula.ac.th; nattapol.p@cmu.ac.th |
Abstract: The Moser’s worm problem asks for a smallest set on the plane that contains a congruent copy of every unit arc. Such smallest covering set has not been found yet. The smallest known cover constructed by Norwood and Poole in 2003 [6] has area 0.260437. In this work, we adapt their idea to construct a smaller cover of area 0.26007. We also simplify the proof that the set constructed this way contains a congruent copy of every unit arc. |
|
Start & End Page |
2528 - 2533 |
Received Date |
2015-02-03 |
Revised Date |
|
Accepted Date |
2018-07-02 |
Full Text |
Download |
Keyword |
covering unit arcs, worm problem |
Volume |
Vol.45 No.6 (September 2018) |
DOI |
|
Citation |
Ploymaklam N. and Wichiramala W., A Smaller Cover of the Moser’s Worm Problem, Chiang Mai J. Sci., 2018; 45(6): 2528-2533. |
SDGs |
|
View:652 Download:256 |