Geodesic
Iterative methods for approximations constructing of optimal covering for nonconvex plane sets
Čelâbinskij fiziko-matematičeskij žurnal, Tome 4 (2019) no. 1, pp. 5-17.

Voir la notice de l'article provenant de la source Math-Net.Ru

Algorithms are offered for the iterative constructing of the optimal coverages for nonconvex plane figures by sets of discs. Their basis are procedures for dividing a figure into areas of the influence of points that serve as the centers of elements of the initial packaging, and finding the Chebyshev centers of these zones. To generate the initial array of points, stochastic procedures are applied that use the synthesis of optimal hexagonal grids and random vectors.
Keywords: optimal coverage, Chebyshev center, Voronoy diagram, Dirichlet zone, nonconvex polygon. 
@article{CHFMJ_2019_4_1_a0,
     author = {P. D. Lebedev},
     title = {Iterative methods for approximations constructing of optimal covering for nonconvex plane sets},
     journal = {\v{C}el\^abinskij fiziko-matemati\v{c}eskij \v{z}urnal},
     pages = {5--17},
     publisher = {mathdoc},
     volume = {4},
     number = {1},
     year = {2019},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/CHFMJ_2019_4_1_a0/}
}
TY  - JOUR
AU  - P. D. Lebedev
TI  - Iterative methods for approximations constructing of optimal covering for nonconvex plane sets
JO  - Čelâbinskij fiziko-matematičeskij žurnal
PY  - 2019
SP  - 5
EP  - 17
VL  - 4
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CHFMJ_2019_4_1_a0/
LA  - ru
ID  - CHFMJ_2019_4_1_a0
ER  - 
%0 Journal Article
%A P. D. Lebedev
%T Iterative methods for approximations constructing of optimal covering for nonconvex plane sets
%J Čelâbinskij fiziko-matematičeskij žurnal
%D 2019
%P 5-17
%V 4
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CHFMJ_2019_4_1_a0/
%G ru
%F CHFMJ_2019_4_1_a0
P. D. Lebedev. Iterative methods for approximations constructing of optimal covering for nonconvex plane sets. Čelâbinskij fiziko-matematičeskij žurnal, Tome 4 (2019) no. 1, pp. 5-17. http://geodesic.mathdoc.fr/item/CHFMJ_2019_4_1_a0/

[1] Kazakov A.L., Lebedev P.D., “Algorithms for constructing pptimal $n$-networks in metric spaces”, Automation and Remote Control, 78:7 (2017), 1290–1301 | DOI | MR | Zbl

[2] H. Melissen, “Densest packings of eleven congruent circles in a circle”, Geometriae Dedicata, 50:1 (1994), 15–25 | DOI | MR | Zbl

[3] A. Heppes, H. Melissen, “Covering a rectangle with equal circles”, Periodica Mathematica Hungarica, 34 (1997), 65–81 | DOI | MR | Zbl

[4] Kazakov A.L., Lempert A.A., Bukharov D.S., “On segmenting logistical zones for servicing continuously developed consumers”, Automation and Remote Control, 74:6 (2013), 968–977 | DOI | MR | Zbl

[5] Desyatov V.G., Systems design for public service objects of industrial plants, Moscow Architecture Institute Publ., Moscow,, 1989, 78 pp. (In Russ.)

[6] Preparata F.P., Shamos M.I., Computational Geometry: An Introduction, Springer-Verlag, New York, 1988, 420 pp. | MR

[7] Dem'yanov V.F., Vasil'ev L.V., Nondifferentiable Optimization, Springer-Verlag, New York, 1985, XVI+452 pp. | MR | MR

[8] Hausdorff F., Set theory, Komkniga Publ., Moscow, 2006, 304 pp. (In Russ.)

[9] Garkavi A.L., “On the existence of an optimal network and a best diameter for a set in a Banach space”, Progress in mathematical sciences, 15:2 (1960), 210–211 (In Russ.)

[10] Garkavi A.L., “On an optimal network and optimal section of a set in a normed space”, News of USSR Academy of sciences. Series mathematical, 26:1 (1962), 87–106 (In Russ.) | Zbl

[11] Mestetskiy L.M., Continuous morphology of binary images: figures, skeletons, circulars, Fizmatlit Publ., Moscow, 2009, 288 pp. (In Russ.)

[12] Brusov V.S., Piyavskii S.A., “A computational algorithm for optimally covering a plane region”, USSR Computational Mathematics and Mathematical Physics, 11:2 (1971), 17–27 | DOI

[13] Lebedev P.D., Uspenskii A.A., Ushakov V.N., “Algorithms of the best approximation for flat sets by unions of discs”, Bulletin of Udmurt University. Mathematica. Mechanics. Computer Sciences, 2013, no. 4, 88–99 (In Russ.) | Zbl

[14] Ushakov V.N., Lebedev P.D., “Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space”, Proceedings of the Steklov Institute of Mathematics, 293, no. 1, 2016, S225–S237 | DOI | DOI | MR | Zbl

[15] Ushakov V.N., Lebedev P.D., “Algorithms of optimal set covering on the planar $\mathbb{R}^2$”, Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki, 26:2 (2016), 258–270 (In Russ.) | MR | Zbl

[16] Piyavskii S.A., “On optimization of networks”, News of USSR Academy of Sciences. Technical cybernetics, 1968, no. 1, 68–80 (In Russ.)

[17] Tóth L.F., Lagerungen in der Ebene auf der Kugel und im Raum, Springer, Berlin, 1953, 197 pp. | MR | Zbl