We study the 2-center problem for moving points in the plane. Given a set P of n points, the Euclidean 2-center problem asks for two congruent disks of minimum size that together cover P. Our methods work in the black-box KDS model, where we receive the locations of the points at regular time steps and we know an upper bound d_max on the maximum displacement of any point within one time step. We show how to maintain a (1 + e)-approximation of the Euclidean 2-center in amortized sub-linear time per time step, under certain assumptions on the distribution of the point set P. In many cases --namely when the distance between the centers of the disks is relatively large or relatively small-- the solution we maintain is actually optimal.
|Publication status||Published - 2013|
|Event||29th European Workshop on Computational Geometry (EuroCG 2013) - Braunschweig, Germany|
Duration: 17 Mar 2013 → 20 Mar 2013
Conference number: 29
|Workshop||29th European Workshop on Computational Geometry (EuroCG 2013)|
|Abbreviated title||EuroCG 2013|
|Period||17/03/13 → 20/03/13|