Chiang Mai Journal of Science

Print ISSN: 0125-2526 | eISSN : 2465-3845

1,647
Articles
Q3 0.80
Impact Factor
Q3 1.3
CiteScore
7 days
Avg. First Decision

Small Convex Covers for Convex Unit Arcs

Wacharin Wichiramala
* Author for corresponding; e-mail address: wacharin.w@chula.ac.th
Volume: Vol.37 No.2 (MAY 2010)
Research Article
DOI:
Received: 1 June 2009, Revised: -, Accepted: 8 March 2010, Published: -

Citation: Wichiramala W., Small Convex Covers for Convex Unit Arcs , Chiang Mai Journal of Science, 2010; 37(2): 185-194.

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.

Keywords: covering by convex sets, convex unit arc, worm problem

Related Articles

A Smaller Cover of the Moser’s Worm Problem
page: 2528 - 2533

Nattapol Ploymaklam and Wacharin Wichiramala

Vol.45 No.6 (September 2018)
Research Article View: 1,017 Download: 407
Outline
Figures