The smallest convex cover for triangles of perimeter two (Q1580280)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The smallest convex cover for triangles of perimeter two |
scientific article; zbMATH DE number 1505845
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The smallest convex cover for triangles of perimeter two |
scientific article; zbMATH DE number 1505845 |
Statements
The smallest convex cover for triangles of perimeter two (English)
0 references
13 September 2000
0 references
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.
0 references
convex sets
0 references
convex cover
0 references
universal cover
0 references
triangle
0 references
0.8536306023597717
0 references
0.8515387177467346
0 references
0.8505707383155823
0 references
0.8478257060050964
0 references
0.8422456383705139
0 references
