Covering a planar domain with sets of small diameter (Q2466328)

The problem of covering a circle, a square or a regular triangle with \(n\) congruent circles of minimum diameter (the circle covering problem) has been investigated by a number of authors and the smallest diameter has been found for \(n\leq 10\). This paper is devoted to the study of an analogous problem, the diameter covering problem, in which the shape and congruence of the pieces is minimized. All cases are considered when the solution of the first problem is known and for \(n\leq 9\) the diameter covering problem is solved, while for \(n=10\) bounds of the minimal diameter are given.