Kinetic connectivity for unit disks

Authors:
Leonidas Guibas;John Hershberger;Subhash Suri;Li Zhang
Affiliations:
Computer Science Department, Stanford University, Stanford, CA;Mentor Graphics Corp., 8005 SW Boeckman Road, Wilsonville, OR;Department of Computer Science, Washington University, St. Louis, MO;Computer Science Department, Stanford University, Stanford, CA
Venue:
Proceedings of the sixteenth annual symposium on Computational geometry
Year:
2000

Computational geometry: an introduction

Computational geometry: an introduction
Skip lists: a probabilistic alternative to balanced trees

Communications of the ACM
Introduction to algorithms

Introduction to algorithms
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Kinetic connectivity of rectangles

SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Data structures for mobile data

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms

Simplified kinetic connectivity for rectangles and hypercubes

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Voronoi Diagrams for Moving Disks and Applications

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
A computational framework for incremental motion

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Distributed proximity maintenance in ad hoc mobile networks

DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Competitive query strategies for minimising the ply of the potential locations of moving points

Proceedings of the twenty-ninth annual symposium on Computational geometry

Hi-index	0.00