Algorithms of the best approximations of the flat sets by the union of circles

DOI10.20537/VM130409zbMATH Open1299.49069OpenAlexW2485437393MaRDI QIDQ2932425FDOQ2932425

Authors:

Publication date: 1 December 2014

Published in: Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/vuu404

Recommendations

• Approximating sets on a plane with optimal sets of circles
• Algorithms of optimal set covering on the planar R^2
• Approximation of polygons with the best set of circles
• Algorithms for constructing optimal \(n\)-networks in metric spaces
• Optimization of multiple covering of a bounded set with circles

zbMATH Keywords

Chebyshev centerbest netcircle cover

Mathematics Subject Classification ID

Variational problems in a geometric measure-theoretic setting (49Q20) Convex sets in (2) dimensions (including convex curves) (52A10)

Cited In (9)

• Optimization of the Hausdorff distance between sets in Euclidean space
• Method for constructing optimal dark coverings
• Chebyshev centres, Jung constants, and their applications
• Approximation of polygons with the best set of circles
• Approximating sets on a plane with optimal sets of circles
• Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space
• Algorithms for constructing optimal \(n\)-networks in metric spaces
• Best approximate circles on integer grids
• Iterative methods for approximations constructing of optimal covering for nonconvex plane sets

This page was built for publication: Algorithms of the best approximations of the flat sets by the union of circles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2932425)