|
This article is cited in 2 scientific papers (total in 2 papers)
Optimization of the number and arrangement of circles of two radii for forming a $k$-covering of a bounded set
Sh. I. Galiev, A. V. Khor'kov Tupolev Kazan National Research Technical University, Kazan, 420111 Russia
Abstract:
A numerical method for investigating $k$-coverings of a convex bounded closed set with nonempty interior with circles of two given radii is proposed. An algorithm for finding an approximate number of such circles and the arrangement of their centers is described. For certain specific cases, approximate lower bounds of the density of the $k$-covering of the given domain are found. Cases with constraints on the distances between the covering circle centers and problems with a variable (given) covering multiplicity are also considered. Numerical results demonstrating the effectiveness of the proposed methods are presented.
Key words:
$k$-covering with circles of two radii, multiple coverings, estimation of density of a $k$-covering with circles of two radii.
Received: 24.10.2017 Revised: 14.11.2018 Accepted: 14.11.2018
Citation:
Sh. I. Galiev, A. V. Khor'kov, “Optimization of the number and arrangement of circles of two radii for forming a $k$-covering of a bounded set”, Zh. Vychisl. Mat. Mat. Fiz., 59:4 (2019), 716–728; Comput. Math. Math. Phys., 59:4 (2019), 676–687
Linking options:
https://www.mathnet.ru/eng/zvmmf10886 https://www.mathnet.ru/eng/zvmmf/v59/i4/p716
|
|