Abstract
We consider the question: "What is the smallest degree that can be achieved for a plane spanner of a Euclidean graph ?" The best known bound on the degree is 14. We show that always contains a plane spanner of maximum degree 6 and stretch factor 6. This spanner can be constructed efficiently in linear time given the Triangular Distance Delaunay triangulation introduced by Chew. © 2010 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Bonichon, N., Gavoille, C., Hanusse, N., & Perković, L. (2010). Plane spanners of maximum degree six. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6198 LNCS, pp. 19–30). Springer Verlag. https://doi.org/10.1007/978-3-642-14165-2_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
