Fully dynamic geometric spanners

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2007, Pages 373-380

  Roditty, Liam ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Algorithms; Dynamic; Geometry; Spanners

Indexed keywords

ALGORITHMS; GRAPH THEORY;

EUCLIDEAN DISTANCE; SPANNERS;

COMPUTATIONAL GEOMETRY;

EID: 35348816721     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1247069.1247134     Document Type: Conference Paper

References (13)

1. S. Arya, D. M. Mount, and M. Smid. Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. Computational Geometry: Theory and Applications, 13:91-107, 1999.
2. G. Ausiello, P. G. Franciosa, and G. F. Italiano. Small stretch spanners on dynamic graphs. In ESA: Annual European Symposium on Algorithms, 2005.
3. A. Bagchi, A. L. Buchsbaum, and M. T. Goodrich. Biased skip lists. Algorithmica, 42, 2005.
4. S. Baswana. Dynamic algorithms for graph spanners. In Yossi Azar and Thomas Erlebach, editors, ESA, volume 4168 of Lecture Notes in Computer Science, pages 76-87. Springer, 2006.
5. S. W. Bent, D. D. Sleator, and R. E. Tarjan. Biased search trees. SIAM Journal on Computing, 14(3):545-568, 1985.
6. P. Bose, J. Gudmundsson, and P. Morin. Ordered theta graphs. Computational Geometry: Theory and Applications, 28:11-18, 2004.
7. P. B. Callahan and S. R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM, 42:67-90, 1995.
8. R. Cole and L. Gottlieb. Searching dynamic point sets in spaces with bounded doubling dimension. In STOC: ACM Symposium on Theory of Computing (STOC), 2006.
9. D. Eppstein, M. T. Goodrich, and J. Z. Sun. The skip quadtree: a simple dynamic data, structure for multidimensional data. In Proc. 21st Symp. Computational Geometry, pages 296-305. ACM, June 2005.
10. J. Gao, L. Guibas, and A. Nguyen. Deformable spanners and applications. In Annual ACM Symposium on Computational Geometry, 2004.
11. R. Krauthgamer and J. Lee. Navigating nets: Simple algorithms for proximity search. In Symposium on Discrete Algorithms, 2004.
12. J. S. Salowe. Constructing multidimensional spanner graphs. Int. J. Comput. Geometry Appl, 1(2):99-107, 1991.
13. P. M. Vaidya. A sparse graph almost as good as the complete graph on points in K dimensions. Discrete & Computational Geometry, 6:369-381, 1991.