Ordered theta graphs

Computational Geometry: Theory and Applications

Volumn 28, Issue 1, 2004, Pages 11-18

  Bose, Prosenjit ^a   Gudmundsson, Joachim ^b   Morin, Pat ^a  

^a CARLETON UNIVERSITY   (Canada)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Low degree; Low diameter; Spanners; Theta graphs

Indexed keywords

EID: 77249154343     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2004.01.003     Document Type: Conference Paper

References (10)

1. S. Arya, G. Das, D.M. Mount, J.S. Salowe, and M. Smid Euclidean spanners: Short, thin, and lanky Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing (STOC '95) 1995 489 498
2. S. Arya, D.M. Mount, and M. Smid Dynamic algorithms for geometric spanners of small diameter: randomized solutions Computational Geometry 13 1999 91 107
3. J.L. Bentley Multidimensional divide-and-conquer Comm. ACM 23 5 1978 214 228
4. P. Dietz, and D. Sleator Two algorithms for maintaining order in a list Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing (STOC '87) 1987 365 372
5. R.L. Graham, D.E. Knuth, and O. Patashnik Concrete Mathematics second ed. 1994 Addison-Wesley
6. J.M. Keil Approximating the complete Euclidean graph Proceedings of the 1st Scandinavian Workshop on Algorithm Theory (SWAT '88) 1988 208 213
7. J.M. Keil, and C.A. Gutwin Classes of graphs which approximate the complete Euclidean graph Discrete Comput. Geom. 7 1992 13 28
8. T. Lukovszki New results on fault-tolerant geometric spanner Proceedings of the 6th International Workshop on Algorithms and Data Structures (WADS '99) 1999 193 204
9. K. Mehlhorn, and S. Näher Dynamic fractional cascading Algorithmica 5 1990 215 241
10. J. Ruppert, and R. Seidel Approximating the d-dimensional complete Euclidean graph Proceedings of the Third Canadian Conference on Computational Geometry (CCCG '91) 1991 207 210