论文信息 - Nonconvex Cases for Carpenter's Rulers

Nonconvex Cases for Carpenter's Rulers

We consider the carpenter’s ruler folding problem in the plane, i.e., finding a minimum area shape with diameter 1 that accommodates foldings of any ruler whose longest link has length 1. An upper bound of 0.614 and a lower bound of 0.476 are known for convex cases. We generalize the problem to simple nonconvex cases: we improve the upper bound to 0.583 and establish the first lower bound of 0.073.

Adrian Dumitrescu | Ke Chen

[1] Adrian Dumitrescu,et al. The Carpenter's Ruler Folding Problem , 2007 .

[2] John E. Wetzel,et al. Sectorial Covers for Curves of Constant Length , 1973, Canadian Mathematical Bulletin.

[3] George D. Poole,et al. Convex Regions which Cover Arcs of Constant Length , 1974 .

[4] H. Eggleston,et al. Minimal universal covers inEn , 1963 .

[5] Rick Norwood,et al. An Improved Upper Bound for Leo Moser's Worm Problem , 2003, Discret. Comput. Geom..

[6] John E. Hopcroft,et al. Movement Problems for 2-Dimensional Linkages , 1984, SIAM J. Comput..

[7] PETER BRASS,et al. A Lower Bound for Lebesgue's Universal Cover Problem , 2005, Int. J. Comput. Geom. Appl..

[8] J. Pál. Ein Minimumproblem für Ovale , 1921 .

[9] R. Norwood,et al. The Worm Problem of Leo Moser , 1992, Discret. Comput. Geom..

[10] János Pach,et al. Research problems in discrete geometry , 2005 .

[11] George D. Poole,et al. Minimum covers for arcs of constant length , 1973 .