An improved upper bound for worm problem

zbMATH Open1119.52005MaRDI QIDQ5294992FDOQ5294992

Wei Wang

Publication date: 26 July 2007

zbMATH Keywords

convex coverdescending region

Mathematics Subject Classification ID

Other problems of combinatorial convexity (52A37) Combinatorial complexity of geometric structures (52C45)

Cited In (4)

• Wetzel's sector covers unit arcs
• An improved upper bound for Leo Moser's worm problem
• Viterbo's conjecture as a worm problem
• Sectorial Covers for Unit Arcs

   Recommendations

• An improved upper bound for Leo Moser's worm problem 👍 👎
• The smallest convex cover for triangles of perimeter two 👍 👎
• Title not available (Why is that?) 👍 👎
• The worm problem of Leo Moser 👍 👎
• LOWER BOUND FOR CONVEX HULL AREA AND UNIVERSAL COVER PROBLEMS 👍 👎

This page was built for publication: An improved upper bound for worm problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5294992)