DeepAI

# Worst-Case Optimal Covering of Rectangles by Disks

We provide the solution for a fundamental problem of geometric optimization by giving a complete characterization of worst-case optimal disk coverings of rectangles: For any λ≥ 1, the critical covering area A^*(λ) is the minimum value for which any set of disks with total area at least A^*(λ) can cover a rectangle of dimensions λ× 1. We show that there is a threshold value λ_2 = √(√(7)/2 - 1/4)≈ 1.035797…, such that for λ<λ_2 the critical covering area A^*(λ) is A^*(λ)=3π(λ^2/16 +5/32 + 9/256λ^2), and for λ≥λ_2, the critical area is A^*(λ)=π(λ^2+2)/4; these values are tight. For the special case λ=1, i.e., for covering a unit square, the critical covering area is 195π/256≈ 2.39301…. The proof uses a careful combination of manual and automatic analysis, demonstrating the power of the employed interval arithmetic technique.

03/19/2019

### Packing Disks into Disks with Optimal Worst-Case Density

We provide a tight result for a fundamental problem arising from packing...
03/12/2021

### Packing Squares into a Disk with Optimal Worst-Case Density

We provide a tight result for a fundamental problem arising from packing...
11/08/2018

### The biclique covering number of grids

We determine the exact value of the biclique covering number for all gri...
08/02/2021

### Efficient covering of convex domains by congruent discs

In this paper, we consider the problem of covering a plane region with u...
08/27/2019

### Outreach Strategies for Vaccine Distribution: A Two-Period Robust Approach

Vaccination has been proven to be the most effective method to prevent i...
02/16/2021

### On Greedily Packing Anchored Rectangles

Consider a set P of points in the unit square U, one of them being the o...
11/27/2022

### Universal convex covering problems under translation and discrete rotations

We consider the smallest-area universal covering of planar objects of pe...