Let S be a set of n points in the plane, let E be the complete Euclidean graph whose point-set is S, and let G be the Delaunay triangulation of S. We present a very simple local algorithm that, given G, constructs a subgraph of G of degree at most 11 that is a geometric spanner of G with stretch factor 2.86, and hence a geometric spanner of E with stretch factor < 7. This algorithm gives an O(n lg n) time centralized algorithm for constructing a subgraph of G that is a geometric spanner of E of degree at most 11 and stretch factor < 7. The algorithm can be generalized to unit disk graphs to give a local algorithm for constructing a plane spanner of a unit disk graph of degree at most 11 and stretch factor < 7. © 2010 Springer-Verlag.
CITATION STYLE
Kanj, I. A., & Xia, G. (2010). Improved local algorithms for spanner construction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6451 LNCS, pp. 1–15). Springer Verlag. https://doi.org/10.1007/978-3-642-16988-5_1
Mendeley helps you to discover research relevant for your work.