Kinetic Connectivity for Unit Disks

We describe a kinetic data structure (KDS) that maintains the connected components of the union of a set of unit-radius disks moving in the plane. We assume that the motion of each disk can be specified by a low-degree algebraic trajectory; this trajectory, however, can be modified in an on-line fashion. While the disks move continuously, their connectivity changes at discrete times. Our main result is an O(n) space data structure that takes O(log  n\slash \kern -1pt log log  n) time per connectivity query of the form ``are disks A and B in the same connected component?’’ A straightforward approach based on dynamically maintaining the overlap graph requires Ω (n2) space. Our data structure requires only linear space and must deal with O(n2 + ε) updates in the worst case, each requiring O(log 2 n) amortized time, for any ε>0 . This number of updates is close to optimal, since a set of n moving unit disks can undergo Ω (n2) connectivity changes.

[1]  Herbert Edelsbrunner,et al.  Modeling with Simplicial Complexes , 1994, Canadian Conference on Computational Geometry.

[2]  Leonidas J. Guibas,et al.  Data Structures for Mobile Data , 1997, J. Algorithms.

[3]  William Pugh,et al.  Skip lists: a probabilistic alternative to balanced trees , 1989, CACM.

[4]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[5]  Chai-Keong Toh,et al.  A novel distributed routing protocol to support ad-hoc mobile computing , 1996, Conference Proceedings of the 1996 IEEE Fifteenth Annual International Phoenix Conference on Computers and Communications.

[6]  Subhash Suri,et al.  Kinetic connectivity of rectangles , 1999, SCG '99.

[7]  H. Edelsbrunner.  The union of balls and its dual shape , 1995 .

[8]  Mikkel Thorup,et al.  Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 1998, STOC '98.

[9]  Takao Asano,et al.  Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane , 1983, J. Algorithms.

[10]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[11]  David B. Johnson,et al.  Routing in Ad Hoc Networks of Mobile Hosts , 1994, 1994 First Workshop on Mobile Computing Systems and Applications.

[12]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .