An improved upper bound for worm problem

MaRDI QIDQ5294992zbMATHFDO

Authors 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)

Recommendations

• An improved upper bound for Leo Moser's worm problem
• The smallest convex cover for triangles of perimeter two
• Bounds for covers of unit arcs
• The worm problem of Leo Moser
• Lower bound for convex hull area and universal cover problems

Cited in

(5)

• Wetzel's sector covers unit arcs
• Sectorial covers for unit arcs
• Viterbo's conjecture as a worm problem
• Improved upper bounds in the moving sofa problem
• An improved upper bound for Leo Moser's worm problem

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)