A computational algorithm for optimally covering a plane region

DOI10.1016/0041-5553(71)90161-3zbMath0286.68023OpenAlexW2036233332MaRDI QIDQ4773292

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)

Related Items (8)

Optimization of the Hausdorff distance between sets in Euclidean space ⋮ Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space ⋮ 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 ⋮ 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 ⋮ Unnamed Item ⋮ Unnamed Item

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