Drapeable unit arcs fit in the unit 30° sector

  title={Drapeable unit arcs fit in the unit 30° sector},
  author={Y. Movshovich and J. E. Wetzel},
  journal={Advances in Geometry},
  pages={497 - 506}
Abstract We show that a 30° circular sector of unit radius contains an isometric copy of every drapeable unit arc, and we describe the family of drapeable exit arcs of unit length in the sector. The conjecture that this sector is a cover for the family of all unit arcs remains unresolved. 
Wetzel's sector covers unit arcs.
We settle J. Wetzel's 1970's conjecture and show that a 30{^\circ} circular sector of unit radius can accommodate every planar arc of unit length. Leo Moser asked in 1966 for the smallest (convex)Expand
Wetzel’s sector covers unit arcs
Leo Moser asked in 1966 for the (convex) region with the smallest area in the plane that can accommodate each arc of unit length, and this sector is the smallest such set presently known. Expand
Sectorial Covers for Unit Arcs
In 1966, Moser [5] asked for the smallest (convex) set in the plane that contains a congruent copy of each planar arc of unit length (see also Moser [6]), a problem known as “the classic wormExpand


Some fundamental properties of drapeability are established, and some sufficient conditions for an arc to be drapeable are investigated. Expand
Escape paths of Besicovitch triangles
The shortest arcs that do not fit in the interior of a compact, convex body in the plane have been called its escape paths. We summarize some basic general facts about such paths. Specializing toExpand
Small Convex Covers for Convex Unit Arcs
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 PooleExpand
Besicovitch triangles cover unit arcs
A long standing conjecture is that the Besicovitch triangle, i.e., an equilateral triangle with side $${\sqrt{28/ 27},}$$ is a worm-cover. We will show that indeed there exists a class of isoscelesExpand
Lost in a Forest
To solve the "lost in a forest" problem the authors must find the "best" escape path, and Bellman proposed two different interpretations of "best," one in which the maximum time to escape is minimized, and one inWhich the expected time to Escape is minimized. Expand
Fits and Covers
Combinatorial Euclidean geometry is replete with appealing, uninvestigated questions of unpredictable depth and difficulty. Interesting, innocent-looking, beguilingly simple questions having to doExpand