Minimal regular polygons serving as universal covers in \({\mathbb{R}}^ 2\) (Q1105200)

A set K in the Euclidean plane is said to be a universal cover if each set of diameter at most 1 can be covered by a congruent copy of K. The authors ask for the smallest (in diameter) regular n-gons serving as universal covers for fixed n. Using a special result of \textit{J. Pál} [Bull. Acad. Dan. 3, No.2, 35 S. (1920), JFM 47.0684.01] for \(n=6\) they prove the following nice theorem: For all \(n>3\) the minimal n-gon that serves as a universal cover is the smallest that contains a Reuleaux triangle of width 1.