Submit your paper 
Download Template JOURNAL DETAIL
Small Convex Covers for Convex Unit Arcs
Paper Type  |
Contributed Paper |
Title |
Small Convex Covers for Convex Unit Arcs |
Author |
Wacharin Wichiramala |
Email |
wacharin.w@chula.ac.th |
|
Abstract: More than 40 years ago, Leo Moser stated a geometry problem on the plane asking for the least-area set that contains a congruent copy of every unit arc. The smallest set known, by Norwood and Poole in 2004, has area 0.26043. One interesting related problem is to focus on a set that contains a congruent copy of every convex unit arc. Such a set is called a cover for convex unit arcs. The smallest cover known, by Wichiramala in 2005, has area 0.2464. In this work we establish a smaller cover for convex unit arcs of area less than 0.242.
|
|
Start & End Page |
185 - 194 |
Received Date |
2009-06-01 |
Revised Date |
|
Accepted Date |
2010-03-08 |
Full Text |
Download |
Keyword |
covering by convex sets, convex unit arc, worm problem |
Volume |
Vol.37 No.2 (MAY 2010) |
DOI |
|
Citation |
Wichiramala W., Small Convex Covers for Convex Unit Arcs , Chiang Mai Journal of Science, 2010; 37(2): 185-194. |
SDGs |
|
| View:605 Download:237 | |
RELATED ARTICLE
A Smaller Cover of the Moser’s Worm Problem
page: 2528 - 2533
Author:Nattapol Ploymaklam and Wacharin Wichiramala
Vol.45 No.6 (September 2018) View: 741 Download:295
page: 2528 - 2533
Author:Nattapol Ploymaklam and Wacharin Wichiramala
Vol.45 No.6 (September 2018) View: 741 Download:295
Copyrights © Since 2021 All Rights Reserved by Chiang Mai Journal of Science