Covering convex regions with unit discs
Simi Haber (Bar-Ilan University)
03/01/2021 - 15:30 - 14:00
Given a convex region C in the plane, how many unit discs are needed to cover it? This classic discrete geometry problem has real life applications in, e.g., placing cellular antennas.
In this talk we will discuss an improved upper bound, an algorithm achieving this bound, and a lower bound showing the algorithm is asymptotically tight for fat regions.
Based on joint work with Reuven Cohen and Shai Gul.
תאריך עדכון אחרון : 31/12/2020