Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space

Resumo

The problem of an optimal cover of sets in three-dimensional Euclidian space by the union of a fixed number of equal balls, where the optimality criterion is the radius of the balls, is studied. Analytical and numerical algorithms based on the division of a set into Dirichlet domains and finding their Chebyshev centers are suggested for this problem. Stochastic iterative procedures are used. Bounds for the asymptotics of the radii of the balls as their number tends to infinity are obtained. The simulation of several examples is performed and their visualization is presented.