|
This article is cited in 4 scientific papers (total in 4 papers)
Mathematics
Iterative methods for approximations constructing of optimal covering for nonconvex plane sets
P. D. Lebedevab a Ural Federal University named after the first President of Russia B. N. Yeltsin, Yekaterinburg, Russia
b Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Yekaterinburg, Russia
Abstract:
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.
Received: 23.01.2019 Revised: 27.02.2019
Citation:
P. D. Lebedev, “Iterative methods for approximations constructing of optimal covering for nonconvex plane sets”, Chelyab. Fiz.-Mat. Zh., 4:1 (2019), 5–17
Linking options:
https://www.mathnet.ru/eng/chfmj122 https://www.mathnet.ru/eng/chfmj/v4/i1/p5
|
Statistics & downloads: |
Abstract page: | 165 | Full-text PDF : | 39 | References: | 22 |
|