A small cover for convex unit arcs

DOI10.1007/S00454-004-0840-0zbMATH Open1068.52002OpenAlexW2072881043MaRDI QIDQ701784FDOQ701784

Authors: Joseph A. Johnson, George D. Poole, John E. Wetzel 

Publication date: 16 December 2004

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-004-0840-0

Recommendations

• Bounds for covers of unit arcs
• Small convex covers for convex unit arcs
• The worm problem of Leo Moser
• scientific article

zbMATH Keywords

worm problemdrapesmallest cover

Mathematics Subject Classification ID

Length, area, volume and convex sets (aspects of convex geometry) (52A38) Convex sets in (2) dimensions (including convex curves) (52A10)

Cited In (11)

• Wetzel's sector covers unit arcs
• The smallest convex cover for triangles of perimeter two
• A convex cover for closed unit curves has area at least 0.1
• A covering theorem for families of sets in \(\mathbb R^d\)
• Small almost complete arcs
• Besicovitch triangles cover unit arcs
• Covers for Angleworms
• Covering \(n\)-segment unit arcs is not sufficient
• A smaller cover for convex unit arcs
• Viterbo's conjecture as a worm problem
• Small convex covers for convex unit arcs

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)