Small universal covers for sets of unit diameter
A subset of the Euclidean plane is called a universal cover, if it can be rotated or translated to cover any planar set of unit diameter. In 1914, Lebesgue asked for universal covers of minimum area. (The question regarding their uniqueness is still open.) An interesting discussion on universal covers is given by \textit{H. T. Croft}, \textit{K. J. Falconer}, and \textit{R. K. Guy} (section D 15 in their book ``Unsolved Problems in Geometry, Springer, New York Inc. (1991)), showing also the strong connection to the famous partition conjecture of Borsuk. In the present paper, the set of convex universal covers is extended by an asymmetrical candidate and, in addition, by a universal cover of sets with an axis of symmetry. Both covers are better than known ones. The author gives hints with respect to computer simulations in the solution of problems of such a type, too.
- Minimal regular polygons serving as universal covers in \({\mathbb{R}}^ 2\)
- Universal covers of finite sets
- Generalized breadths, circular Cantor sets, and the least area UCC
- Quermass-integrals of centro-symmetric universal covers
- Smallest enclosing cylinders
- Around Borsuk's hypothesis
- The plane-width of graphs
- scientific article; zbMATH DE number 4019891 (Why is no real title available?)
- On universal covers in normed planes
- A LOWER BOUND FOR LEBESGUE'S UNIVERSAL COVER PROBLEM
This page was built for publication: Small universal covers for sets of unit diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1189647)