Geometric spanners with few edges and degree five

Conferences in Research and Practice in Information Technology Series

Volumn 51, Issue , 2006, Pages

  Smid, Michiel ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

Computational geometry; Minimum spanning trees; Spanners

Indexed keywords

GEOMETRIC SPANNER; MINIMUM SPANNING TREES; POINT SET; SPANNERS; STRETCH FACTOR; TIME ALGORITHMS; VERTEX SET;

COMPUTATIONAL GEOMETRY;

COMPUTATION THEORY;

EID: 84863570611     PISSN: 14451336     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. Aronov, B., de Berg, M., Cheong, O., Gudmundsson, J., Haverkort, H. andVigneron, A. (2005), Sparse geometric graphs with small dilation, in 'Proceedings of the 16th International Symposium on Algorithms and Computation', Lecture Notes in Computer Science, Springer-Verlag, Berlin.
2. Das, G. andHeffernan, P. J. (1996), 'Constructing degree-3 spanners with other sparseness properties', International Journal of Foundations of Computer Science 7, 121{135.
3. Eppstein, D. (2000), Spanning trees and spanners, in J.-R. Sack andJ. Urrutia, eds, 'Handbook of Computational Geometry', Elsevier Science, Amsterdam, pp. 425{461.
4. Erickson, J. (1995), On the relative complexities of some geometric problems, in 'Proceedings of the 7th Canadian Conference on Computational Geometry', pp. 85{90.
5. Gudmundsson, J. andKnauer, C. (2006), Dilation and detours in geometric networks, T. F. Gonzalez, ed., 'Handbook on Approximation Algorithms and Metaheuristics', Chapman andHall/CRC, Boca Raton
6. Salowe, J. S. (1991), 'Constructing multidimensional spanner graphs', International Journal of Computational Geometry andApplications 1, 99{107.
7. Smid, M. (2000), Closest-point problems in computational geometry, 'Handbook of Computational Geometry', in J.-R. Sack andJ. Urrutia, eds, Elsevier Science, Amsterdam, pp. 877{935.
8. Vaidya, P. M. (1991), 'A sparse graph almost as good as the complete graph on points in K dimensions', Discrete andComputational Geometry 6, 369{381