A computational algorithm for optimally covering a plane region

DOI10.1016/0041-5553(71)90161-3MaRDI QIDQ4773292zbMATH OpenOpenAlexFDO

Authors V. S. Brusov, S. A. Piyavsky

Publication date 1973

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(71)90161-3

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Cited in

(8)

• Optimization of the Hausdorff distance between sets in Euclidean space
• On the number and arrangement of sensors for the multiple covering of bounded plane domains
• On reserve and double covering problems for the sets with non-Euclidean metrics
• Algorithms of minimization of Hausdorff deviation of a convex compact from a set of movable convex polygons
• Algorithms for constructing optimal covering of planar figures with disks sets of linearly different radii
• On multiple coverings of fixed size containers with non-Euclidean metric by circles of two types
• Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space
• Iterative methods for approximations constructing of optimal covering for nonconvex plane sets

This page was built for publication: A computational algorithm for optimally covering a plane region

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