The smallest convex cover for triangles of perimeter two

DOI10.1023/A:1005298816467MaRDI QIDQ1580280zbMATH OpenOpenAlexFDO

Authors John E. Wetzel, Zoltán Füredi

Publication date 13 September 2000

Published in Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1005298816467

zbMATH Keywords

convex coverconvex setstriangleuniversal cover

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Review text

The ``worm problem by Leo Moser asks for the region of smallest area which will accommodate every arc of length 1. There are various variants of this still unsolved problem and the authors consider the following: Find the smallest convex region in the plane which contains a congruent copy of every triangle of perimeter two. The authors show that the solution is a triangle and give its (unique) shape.

Recommendations

• A small cover for convex unit arcs
• Parallelogram cover for triangles of perimeter two
• An improved upper bound for Leo Moser's worm problem
• The worm problem of Leo Moser
• Besicovitch triangles cover unit arcs

Cited in

(11)

• The smallest triangular cover for triangles of diameter one
• Viterbo's conjecture as a worm problem
• Covers for Angleworms
• Escape paths of Besicovitch triangles
• The Smallest Equilateral Cover for Triangles of Perimeter Two
• An improved upper bound for worm problem
• scientific article; zbMATH DE number 2237541 (Why is no real title available?)
• Parallelogram cover for triangles of perimeter two
• Covers for closed curves of length two
• Smallest universal covers for families of triangles
• Besicovitch triangles cover unit arcs

This page was built for publication: The smallest convex cover for triangles of perimeter two

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