The smallest convex cover for triangles of perimeter two
type: Item
instance of: scholarly article
title: The smallest convex cover for triangles of perimeter two
zbMATH Open document ID: 0959.52001
DOI: 10.1023/A:1005298816467
author: John E. Wetzel
author: Zoltán Füredi
published in: Geometriae Dedicata
publication date: 2000-09-13T00:00:00Z
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.
Mathematics Subject Classification ID: 52A10
Mathematics Subject Classification ID: 52C15
zbMATH DE Number: 1505845
zbMATH Keywords: convex sets
zbMATH Keywords: convex cover
zbMATH Keywords: universal cover
zbMATH Keywords: triangle
reviewed by: Jörg M. Wills
MaRDI profile type: Publication
full work available at URL: a:1005298816467
OpenAlex ID: W113338603
description: scientific article; zbMATH DE number 1505845