Worst-case optimal covering of rectangles by disks
DOI10.1007/S00454-023-00582-1MaRDI QIDQ6624196FDOQ6624196
Authors: Sándor P. Fekete, Utkarsh Gupta, Phillip Keldenich, Christian Scheffer 
Publication date: 25 October 2024
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Recommendations
approximationinterval arithmeticcritical densitydisk coveringtight worst-case boundcovering coefficient
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of packing and covering (05B40) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Cites Work
- Split packing: an algorithm for packing circles with optimal worst-case density
- Research Problems in Discrete Geometry
- Title not available (Why is that?)
- Covering Points by Unit Disks of Fixed Location
- Covering a rectangle with six and seven circles
- Multi cover of a polygon minimizing the sum of areas
- Covering a line segment with variable radius discs
- Covering a rectangle with equal circles
- Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles
- Optimal circle covering problems and their applications
- Efficient algorithm for placing a given number of base stations to cover a convex region
- Thinnest covering of a circle by eight, nine, or ten congruent circles
- Curved hexagonal packings of equal disks in a circle
- Dense packings of congruent circles in a circle
- Minimum-cost coverage of point sets by disks
- The densest packing of 19 congruent circles in a circle
- Densest packings of eleven congruent circles in a circle
- The densest packing of 13 congruent circles in a circle
- The densest packing of 12 congruent circles in a circle
- Title not available (Why is that?)
- Some packing and covering theorems
- A Finite Packing Problem
- Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)
- Title not available (Why is that?)
- Worst-case optimal covering of rectangles by disks
- VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION
- Loosest Circle Coverings of an Equilateral Triangle
- Packing of 14, 16, 17 and 20 Circles in a Circle
- Dense Packing of Equal Circles within a Circle
- On the solution of numerical functional equations.
- Optimal cover of a disk with three smaller congruent disks
- Split packing: algorithms for packing circles with optimal worst-case density
- A constant-factor approximation for multi-covering with disks
- Title not available (Why is that?)
- Covering rectangles by disks: the video (media exposition)
Cited In (2)
This page was built for publication: Worst-case optimal covering of rectangles by disks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6624196)
