Diamond triangulations contain spanners of bounded degree

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4288 LNCS, Issue , 2006, Pages 173-182

  Bose, Prosenjit ^a   Smid, Michiel ^a   Xu, Daming ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED DEGREE; DEGREE BOUNDS; DELAUNAY; DELAUNAY TRIANGULATION; DIAMOND PROPERTY; MAXIMUM DEGREE; REAL NUMBER; SUBGRAPHS; TIME ALGORITHMS; UNIT DISK GRAPHS; VERTEX SET;

DIAMONDS; NUMBER THEORY; TRIANGULATION;

COMPUTATION THEORY;

EID: 77249160762     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11940128_19     Document Type: Conference Paper

References (11)

1. P. Bose, J. Gudmundsson, and M. Smid. Constructing plane spanners of bounded degree and low weight. Algorithmica, 42:249-264, 2005.
2. P. Bose, A. Maheshwari, G. Narasimhan, M. Smid, and N. Zeh. Approximating geometric bottleneck shortest paths. Computational Geometry: Theory and Applications, 29:233-249, 2004.
3. P. Bose and P. Morin. Online routing in triangulations. SIAM Journal on Computing, 33:937-951, 2004.
4. P. Bose, M. Smid, and D. Xu. Diamond triangulations contain spanners of bounded degree. Carleton University, Computer Science Technical Report, 2006.
5. L. P. Chew. There are planar graphs almost as good as the complete graph. Journal of Computer and System Sciences, 39:205-219, 1989.
6. G. Das and D. Joseph. Which triangulations approximate the complete graph? In Proceedings of the International Symposium on Optimal Algorithms, volume 401 of Lecture Notes in Computer Science, pages 168-192, Berlin, 1989. Springer-Verlag.
7. D. P. Dobkin, S. J. Friedman, and K. J. Supowit. Delaunay graphs are almost as good as complete graphs. Discrete & Computational Geometry, 5:399-407, 1990.
8. J. M. Keil and C. A. Gutwin. Classes of graphs which approximate the complete Euclidean graph. Discrete & Computational Geometry, 7:13-28, 1992.
9. A. W. Lee. Diamonds are a plane graph's best friend. Master's thesis, School of Computer Science, Carleton University, Ottawa, 2004.
10. X.-Y. Li and Y. Wang. Efficient construction of low weighted bounded degree planar spanner. International Journal of Computational Geometry & Applications, 14:69-84, 2004.
11. G. Narasimhan and M. Smid. Geometric Spanner Networks. Cambridge University Press, Cambridge, UK, 2007.