scientific article; zbMATH DE number 7405302

DOI10.24411/2500-0101-2019-14101zbMath1470.52019MaRDI QIDQ5153818

No author found.

Publication date: 1 October 2021

Full work available at URL: http://mathnet.ru/eng/chfmj122

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

optimal coverageChebyshev centernonconvex polygonDirichlet zonevoronoy diagram

Mathematics Subject Classification ID

Convex programming (90C25) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Combinatorial aspects of packing and covering (05B40)

Related Items

Algorithms for constructing optimal covering of planar figures with disks sets of linearly different radii

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space
• On segmenting logistical zones for servicing continuously developed consumers
• Densest packings of eleven congruent circles in a circle
• Covering a rectangle with equal circles
• Algorithms for constructing optimal \(n\)-networks in metric spaces
• Algorithms of the best approximations of the flat sets by the union of circles
• A computational algorithm for optimally covering a plane region
• Algorithms of optimal set covering on the planar R^2
• Felix Hausdorff Gesammelte Werke