In this paper, we consider the dynamic version of covering the convex hull of a point set P in R2 by two congruent disks of minimum size. Here, the points can be added or deleted in the set P, and the objective is to maintain a data structure that, at any instant of time, can efficiently report two disks of minimum size whose union completely covers the boundary of the convex hull of the point set P. We show that maintaining a linear size data structure, we can report a radius r satisfying r 2ropt at any query time, where ropt is the optimum solution at that instant of time. For each insertion or deletion of a point in P, the update time of our data structure is O(log n). Our algorithm can be tailored to work in the restricted streaming model where only insertions are allowed, using constant work-space. The problem studied in this paper has novelty in two ways: (i) it computes the covering of the convex hull of a point set P, which has lot of surveillance related applications, but not studied in the literature, and (ii) it also considers the dynamic version of the problem. In the dynamic setup, the extent measure problems are studied very little, and in particular, the k-center problem is not at all studied for any k2.

Approximation algorithm, Computational geometry, Dynamic setup, Lower bound, Two-center problem
Fundamenta Informaticae
Computational Geometry Lab

Sadhu, S. (Sanjib), Roy, S. (Sasanka), Nandi, S. (Soumen), Maheshwari, A, & Nandy, S.C. (Subhas C.). (2019). Two-center of the convex hull of a point set: Dynamic model, and restricted streaming model. Fundamenta Informaticae, 164(1), 119–138. doi:10.3233/FI-2019-1757