A Smaller Cover of the Moser’s Worm Problem
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...
Saved in:
Main Authors: | Nattapol Ploymaklam, Wacharin Wichiramala |
---|---|
Format: | บทความวารสาร |
Language: | English |
Published: |
Science Faculty of Chiang Mai University
2019
|
Online Access: | http://it.science.cmu.ac.th/ejournal/dl.php?journal_id=9538 http://cmuir.cmu.ac.th/jspui/handle/6653943832/64225 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Language: | English |
Similar Items
-
A smaller cover of the moser’s worm problem
by: Nattapol Ploymaklam, et al.
Published: (2018) -
Wetzel’s sector covers unit arcs
by: Chatchawan Panraksa, et al.
Published: (2020) -
An application of moser iteration to complete minimal submanifolds in a sphere
by: Cheung, L.-F., et al.
Published: (2014) -
Safety in numbers : problems of a smaller U.S. nuclear arsenal in Asia
by: Christine M. Leah
Published: (2014) -
A local discontinuous Galerkin method for the reduced Burgers-Poisson equation
by: Nattapol Ploymaklam
Published: (2020)