On covering bounded sets by collections of circles of various radii (Q2307921)

Let \(M\) be a compact set in the Euclidean plane, and \(\alpha_1, \ldots, \alpha_n\) be positive real numbers. The authors examine the problem of finding the smallest number \(r > 0\) such that there is a family of \(n\) circular disks, with radii \(r \alpha_1, r \alpha_2,\ldots, r \alpha_n\) that covers \(M\). The authors propose an algorithm that estimates this value. The algorithm is based on computing generalized Dirichlet cells of discrete point sets and their circumcenters, and applying modifications. In addition, they carry out numeric experiments to test the properties of their algorithm.