Abstract
We describe an algorithm that builds a plane spanner with a maximum degree of 8 and a spanning ratio of \({\approx }4.414\) with respect to the complete graph. This is the best currently known spanning ratio for a plane spanner with a maximum degree of less than 14.
This work was partially supported by the Natural Sciences and Engineering Research Council of Cananda (NSERC) and by the Ontario Graduate Scholarship (OGS).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Chew, P.: There is a planar graph almost as good as the complete graph. In: Proceedings of the Second Annual Symposium on Computational Geometry, SCG 1986, pp.169–177. ACM, New York (1986)
Dobkin, D., Friedman, S., Supowit, K.: Delaunay graphs are almost as good as complete graphs. Discrete & Comput. Geom. 5, 399–407 (1990)
Keil, J., Gutwin, C.: Classes of graphs which approximate the complete euclidean graph. Discrete & Comput. Geom. 7, 13–28 (1992)
Xia, G.: Improved upper bound on the stretch factor of Delaunay triangulations. In: Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry, SoCG 2011, pp. 264–273. ACM, New York (2011)
Bose, P., Gudmundsson, J., Smid, M.: Constructing plane spanners of bounded degree and low weight. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 234–246. Springer, Heidelberg (2002)
Li, X.Y., Wang, Y.: Efficient construction of low weight bounded degree planar spanner. In: Warnow, T., Zhu, B. (eds.) Comput. Comb. Lecture Notes in Computer Science, vol. 2697, pp. 374–384. Springer, Berlin Heidelberg (2003)
Bose, P., Smid, M.H.M., Xu, D.: Delaunay and diamond triangulations contain spanners of bounded degree. Int. J. Comput. Geom. Appl. 19, 119–140 (2009)
Kanj, I.A., Perković, L., Xia, G.: On spanners and lightweight spanners of geometric graphs. SIAM J. Comput. 39, 2132–2161 (2010)
Bose, P., Carmi, P., Chaitman-Yerushalmi, L.: On bounded degree plane strong geometric spanners. J. Discrete Algorithms 15, 16–31 (2012)
Bonichon, N., Gavoille, C., Hanusse, N., Perković, L.: Plane spanners of maximum degree six. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 19–30. Springer, Heidelberg (2010)
Bonichon, N., Kanj, I., Perković, L., Xia, G.: There are plane spanners of degree 4 and moderate stretch factor. Discrete & Comput. Geom. 53, 514–546 (2015)
Bose, P., Keil, J.M.: On the stretch factor of the constrained Delaunay triangulation. In: 3rd International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2006, Banff, Alberta, Canada, pp. 25–31, 2–5 July 2006. IEEE Computer Society (2006)
Benson, R.: Euclidean Geometry and Convexity. McGraw-Hill, New York (1966)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bose, P., Hill, D., Smid, M. (2016). Improved Spanning Ratio for Low Degree Plane Spanners. In: Kranakis, E., Navarro, G., Chávez, E. (eds) LATIN 2016: Theoretical Informatics. LATIN 2016. Lecture Notes in Computer Science(), vol 9644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49529-2_19
Download citation
DOI: https://doi.org/10.1007/978-3-662-49529-2_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-49528-5
Online ISBN: 978-3-662-49529-2
eBook Packages: Computer ScienceComputer Science (R0)