Algorithms for constructing optimal covering of planar figures with disks sets of linearly different radii
From MaRDI portal
Publication:6180999
DOI10.26516/1997-7670.2023.46.35OpenAlexW4389568190MaRDI QIDQ6180999
Krasimir Lyudmilov Stoĭchin, Pavel Dmitrievich Lebedev
Publication date: 22 January 2024
Published in: Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)
Full work available at URL: https://mathizv.isu.ru/en/article/file?id=1468
Best approximation, Chebyshev systems (41A50) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Covering the plane with two kinds of circles
- On covering bounded sets by collections of circles of various radii
- On reserve and double covering problems for the sets with non-Euclidean metrics
- Mathematical Explorations with MATLAB
- About Routing in the Sheet Cutting
- A computational algorithm for optimally covering a plane region
- On Multiple Coverings of Fixed Size Containers with Non-Euclidean Metric by Circles of Two Types
- Algorithms for constructing suboptimal coverings of plane figures with disks in the class of regular lattices
This page was built for publication: Algorithms for constructing optimal covering of planar figures with disks sets of linearly different radii