Algorithms for constructing suboptimal coverings of plane figures with disks in the class of regular lattices
From MaRDI portal
Publication:6169139
DOI10.35634/2226-3594-2023-61-05zbMath1516.11073OpenAlexW4379466776MaRDI QIDQ6169139
Oleg Aleksandrovich Kuvshinov, Pavel Dmitrievich Lebedev
Publication date: 10 August 2023
Published in: Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/iimi443
Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Lattice packing and covering (number-theoretic aspects) (11H31) Combinatorial aspects of packing and covering (05B40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization of the Hausdorff distance between sets in Euclidean space
- Optimal circle covering problems and their applications
- On segmenting logistical zones for servicing continuously developed consumers
- Packing, covering and tiling in two-dimensional spaces
- Thinnest covering of the Euclidean plane with incongruent circles
- On a relation between packing and covering densities of convex bodies
- An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem
- Covering a ball by smaller balls
- Mathematical Explorations with MATLAB
- Algorithms of Optimal Packing Construction in Ellipse
- A Shape Optimization Approach to the Problem of Covering a Two-Dimensional Region with Minimum-Radius Identical Balls
- OPTIMIZATION OF THE ALGORITHM FOR DETERMINING THE HAUSDORFF DISTANCE FOR CONVEX POLYGONS
- Algorithms of optimal set covering on the planar R^2
- About the geometry of the Cassini oval, its non-convexity degree and $\varepsilon$-offset layer
- Algorithms of optimal covering of 2D sets with dynamical metrics
This page was built for publication: Algorithms for constructing suboptimal coverings of plane figures with disks in the class of regular lattices
