Approximating sets on a plane with optimal sets of circles

We study optimal networks on a plane. We generalize the Chebyshev center of a set on the case of several points. We propose numerical and analytic methods for finding a placement of a fixed number of points that minimizes the Hausdorff deviation of a given set from these points. We develop and experiment with software for computing a network of two or three points for the case of flat figures. We show examples of modeling optimal coverings of polyhedra by sets of one, two, or three circles. Based on these networks, we propose an approximation of flat, in general nonconvex, sets by collections of circles.