Dynamic Geometric Set Cover, Revisited

Geometric set cover is a classical problem in computational geometry, which has been extensively studied in the past. In the dynamic version of the problem, points and ranges may be inserted and deleted, and our goal is to efficiently maintain a set cover solution (satisfying certain quality requirement) for the dynamic problem instance. In this paper, we give a plethora of new dynamic geometric set cover data structures in 1D and 2D, which significantly improve and extend the previous results. Our results include the following:

• The first data structure for (1 + ε)-approximate dynamic interval set cover with polylogarithmic amortized update time. Specifically, we achieve an update time of O(log 3 n/ε), improving the O(n δ /ε) bound of Agarwal et al. [SoCG'20], where δ > 0 denotes an arbitrarily small constant.

• A data structure for O(1)-approximate dynamic unit-square set cover with 2 O( √ log n) amortized update time, substantially improving the O(n 1/2+δ ) update time of Agarwal et al. [SoCG'20].

• A data structure for O(1)-approximate dynamic square set cover with O(n 1/2+δ ) randomized amortized update time, improving the O(n 2/3+δ ) update time of Chan and He [SoCG'21].

• A data structure for O(1)-approximate dynamic 2D halfplane set cover with O(n 17/23+δ ) randomized amortized update time. The previous solution for halfplane set cover by Chan and He [SoCG'21] is slower and can only report the size of the approximate solution.

• The first sublinear results for the weighted version of dynamic geometric set cover. Specifically, we give a data structure for (3 + o(1))-approximate dynamic weighted interval set cover with 2 O( √ log n log log n) amortized update time and a data structure for O(1)-approximate dynamic weighted unit-square set cover with O(n δ ) amortized update time.