Dynamic algorithms for geometric spanners of small diameter: Randomized solutions

Computational Geometry: Theory and Applications

Volumn 13, Issue 2, 1999, Pages 91-107

  Arya, Sunil ^a,d   Mount, David M ^b   Smid, Michiel ^c,d  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b UNIVERSITY OF MARYLAND   (United States)

^c OTTO VON GUERICKE UNIVERSITY   (Germany)

^d MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Computational geometry; Dynamic data structures; Proximity problems; Randomization; Skip lists

Indexed keywords

EID: 0038775376     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(99)00014-0     Document Type: Article

References (18)

1. S. Arya, G. Das, D.M. Mount, J.S. Salowe, M. Smid, Euclidean spanners: short, thin, and lanky, in: Proc. 27th Annu. ACM Symp. on the Theory of Computing, 1995, pp. 489-498.
2. S. Arya, D.M. Mount, M. Smid, Randomized and deterministic algorithms for geometric spanners of small diameter, in: Proc. 35th Annu. IEEE Symp. on Foundations of Computer Science, 1994, pp. 703-712.
3. S. Arya, M. Smid, Efficient construction of a bounded degree spanner with low weight, Algorithmica 17 (1997) 33-54.
4. P.B. Callahan, S. Rao Kosaraju, Faster algorithms for some geometric graph problems in higher dimensions, in: Proc. 4th Annu. ACM-SIAM Symp. on Discrete Algorithms, 1993, pp. 291-300.
5. B. Chazelle, J. Friedman, Point location among hyperplanes and unidirectional ray-shooting, Computational Geometry 4 (1994) 53-62.
6. K.L. Clarkson, Approximation algorithms for shortest path motion planning, in: Proc. 19th Annu. ACM Sympos. Theory Comput., 1987, pp. 56-65.
7. G. Das, G. Narasimhan, A fast algorithm for constructing sparse Euclidean spanners, in: Proc. 10th Annu. ACM Sympos. Comput. Geom., 1994, pp. 132-139.
8. G. Das, G. Narasimhan, J.S. Salowe, A new way to weigh malnourished Euclidean graphs, in: Proc. 6th Annu. ACM-SIAM Symp. on Discrete Algorithms, 1995, pp. 215-222.
9. J.M. Keil, C.A. Gutwin, Classes of graphs which approximate the complete Euclidean graph, Discrete Comput. Geom. 7 (1992) 13-28.
10. G.S. Lueker, A data structure for orthogonal range queries, in: Proc. 19th Annu. IEEE Symp. on Foundations of Computer Science, 1978, pp. 28-34.
11. K. Mehlhorn, S. Näher, Dynamic fractional cascading, Algorithmica 5 (1990) 215-241.
12. K. Mulmuley, Computational Geometry, An Introduction through Randomized Algorithms, Prentice-Hall, Englewood Cliffs, NJ, 1994.
13. F.P. Preparata, M.I. Shamos, Computational Geometry, An Introduction, Springer, New York, 1985.
14. W. Pugh, Skip lists: a probabilistic alternative to balanced search trees, Commun. ACM 33 (1990) 668-676.
15. J. Ruppert, R. Seidel, Approximating the d-dimensional complete Euclidean graph, in: Proc. 3rd Canadian Conf. on Computational Geometry, 1991, pp. 207-210.
16. J.S. Salowe, Constructing multidimensional spanner graphs, Internat. J. Comput. Geom. Appl. 1 (1991) 99-107.
17. P.M. Vaidya, A sparse graph almost as good as the complete graph on points in K dimensions, Discrete Comput. Geom. 6 (1991) 369-381.
18. A.C. Yao, On constructing minimum spanning trees in k-dimensional spaces and related problems, SIAM J. Comput. 11 (1982) 721-736.