Iterative methods for approximations constructing of optimal covering for nonconvex plane sets

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.