Algorithms of the best approximations of the flat sets by the union of circles
From MaRDI portal
Publication:2932425
DOI10.20537/VM130409zbMATH Open1299.49069OpenAlexW2485437393MaRDI QIDQ2932425FDOQ2932425
Author name not available (Why is that?)
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
Variational problems in a geometric measure-theoretic setting (49Q20) Convex sets in (2) dimensions (including convex curves) (52A10)
Cited In (6)
- Optimization of the Hausdorff distance between sets in Euclidean space
- Chebyshev centres, Jung constants, and their applications
- Title not available (Why is that?)
- 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
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)
