A smaller cover of the moser’s worm problem
© 2018, Chiang Mai University. All rights reserved. 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.2604...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Journal |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85056428911&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/62569 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Summary: | © 2018, Chiang Mai University. All rights reserved. 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. |
|---|