Constructing plane spanners of bounded degree and low weight

Algorithmica (New York)

Volumn 42, Issue 3-4, 2005, Pages 249-264

  Bose, Prosenjit ^a   Gudmundsson, Joachim ^b   Smid, Michiel ^a  

^a CARLETON UNIVERSITY   (Canada)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Bounded degree graphs; Computational geometry; Low weight graphs; Planar graphs; Spanners

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; GRAPH THEORY; SURVEYS; TRIANGULATION;

BOUNDED DEGREE GRAPHS; LOW WEIGHT GRAPHS; PLANAR GRAPHS; SPANNERS;

ALGORITHMS;

EID: 22344456117     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-005-1168-8     Document Type: Conference Paper

References (27)

1. I. Althöfer, G. Das, D. Dobkin, and D. Joseph. Generating sparse spanners for weighted graphs. In Proc. 2nd Scandinavian Workshop on Algorithm Theory, pages 26-37, 1990.
2. I. Althöfer, G. Das, D. P. Dobkin, D. Joseph, and J. Scares. On sparse spanners of weighted graphs. Discrete & Computational Geometry, 9:81-100, 1993.
3. S. Arikati, D. Z. Chen, L. P. Chew, G. Das, M. Smid, and C. D. Zaroliags. Planar spanners and approximate shortest path queries among obstacles in the plane. In Proc. 4th European Symposium on Algorithms, pages 514-528, 1996.
4. S. Arya, G. Das, D. M. Mount, J. S. Salowe, and M. Smid. Euclidean spanners: short, thin, and lanky. In Proc. 21th Annual ACM Symposium on Theory of Computing, pages 489-498, 1995.
5. D. Barnette. Trees in polyhedral graphs. Canadian Journal of Mathematics, 18:731-736, 1966.
6. P. Bose, J. Gudmundsson, and P. Morin. Ordered theta graphs. Computational Geometry - Theory and Applications, 28(1):11-18, 2004.
7. P. Bose and P. Morin. Online routing in triangulations. In Proc. 10th Annual International Symposium on Algorithms and Computation, pages 113-122. Volume 1741 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1999.
8. P. Chew. Constrained delaunay triangulations. Algorithmica, 4:97-108, 1989.
9. M. Chrobak and T. Payne. A linear-time algorithm for drawing a planar graph on a grid. Information Processing Letters, 54:241-246, 1995.
10. A. Czumaj and H. Zhao. Fault-tolerant geometric spanners. In Proc. 19th Symposium on Computational Geometry, pages 1-10, 2003.
11. G. Das, P. Heffernan, and G. Narasimhan. Optimally sparse spanners in 3-dimensional Euclidean space. In Proc. 9th Annual ACM Symposium on Computational Geometry, pages 53-62, 1993.
12. G. Das and D. Joseph. Which triangulations approximate the complete graph? In Proc. International Symposium on Optimal Algorithms, pages 168-192. Volume 401 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1989.
13. G. Das and G. Narasimhan. A fast algorithm for constructing sparse Euclidean spanners. International Journal of Computational Geometry and Applications, 7:297-315, 1987.
14. G. Das, G. Narasimhan, and J. Salowe. A new way to weigh malnourished Euclidean graphs. In Proc. 6th ACM-SIAM Symposium on Discrete Algorithms, pages 215-222, 1995.
15. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications, 2nd edition. Springer-Verlag, Berlin, 2000.
16. H. de Fraysseix, J. Fach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41-51, 1990.
17. 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.
18. D. Eppstein. Spanning trees and spanners. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 425-461. Elsevier Science, Amsterdam, 2000.
19. J. Gudmundsson, C. Levcopoulos, and G. Narasimhan. Improved greedy algorithms for constructing sparse geometric spanners. SIAM Journal of Computing, 31(5):1479-1500, 2002.
20. J. M. Keil. Approximating the complete Euclidean graph. In Proc. 1st Scandinavian Workshop on Algorithm Theory, pages 208-213, 1988.
21. J. M. Keil and C. A. Gutwin. Classes of graphs which approximate the complete Euclidean graph. Discrete & Computational Geometry, pages 13-28, 1992.
22. C. Levcopoulos and A. Lingas. There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees. Algorithmica, 8:251-256, 1992.
23. C. Levcopoulos, G. Narasimhan, and M. Smid. Improved algorithms for constructing fault-tolerant spanners. Algorithmica, 32:144-156, 2002.
24. J. S. Salowe. Constructing multidimensional spanner graphs. International Journal of Computational Geometry & Applications, 1(2):99-107, 1991.
25. M. Smid. Closest point problems in computational geometry. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 877-935. Elsevier Science, Amsterdam, 2000.
26. 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.
27. C. A. Wang and L. K. Schubert. An optimal algorithm for constructing the delaunay triangulation of a set of line segments. In Proc. 3rd Annual ACM Symposium on Computational Geometry, pages 223-232, 1987.