Moser's worm problem asks for convex sets of least area which contain a congruent copy of every arc of length \(1\). Wetzel noticed that an isosceles right triangle of hypotenuse \(1\), with area 0.2500, contains a congruent copy of every convex arc of length \(1\) (a convex arc being a simple arc which lies on the boundary of its convex hull). The authors improve Wetzel's result by providing a convex set with area less than 0.2466 which contains a congruent copy of every convex arc of length \(1\).
Recommendations
Cited in
(18)- The worm problem of Leo Moser
- The smallest convex cover for triangles of perimeter two
- Small almost complete arcs
- Wetzel's sector covers unit arcs
- \(z\)-arcs in the thirty degrees sector
- A convex cover for closed unit curves has area at least 0.1
- Viterbo's conjecture as a worm problem
- Lower bound for convex hull area and universal cover problems
- Covers for Angleworms
- Small convex covers for convex unit arcs
- Besicovitch triangles extended
- Bounds for covers of unit arcs
- Sectorial covers for unit arcs
- A smaller cover for closed unit curves
- A smaller cover for convex unit arcs
- Covering \(n\)-segment unit arcs is not sufficient
- Besicovitch triangles cover unit arcs
- A covering theorem for families of sets in R^d
This page was built for publication: A small cover for convex unit arcs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q701784)
