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


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

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.

About the authors

V. N. Ushakov

Krasovskii Institute of Mathematics and Mechanics; Ural Federal University

Author for correspondence.
Email: ushak@imm.uran.ru
Russian Federation, ul. S. Kovalevskoi 16, Yekaterinburg, 620990; ul. Mira 32, Yekaterinburg, 620002

P. D. Lebedev

Krasovskii Institute of Mathematics and Mechanics

Email: ushak@imm.uran.ru
Russian Federation, ul. S. Kovalevskoi 16, Yekaterinburg, 620990

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2016 Pleiades Publishing, Ltd.