Cited By
View all- Anderson FGhosh AGraham MMougeot LWisnosky D(2023)Bounded-Degree Plane Geometric Spanners in PracticeACM Journal of Experimental Algorithmics10.1145/358249728(1-36)Online publication date: 8-Apr-2023
Improved local algorithms for spanner construction
Authors: 
Iyad A. Kanj, Ge XiaAuthors Info & Claims
Iyad A. Kanj, Ge XiaAuthors Info & ClaimsAbstract
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(nlgn) 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.
References
[1]
Benson, R., Euclidean Geometry and Convexity. 1966. Mc-Graw Hill, New York.
[2]
Bonichon, N., Gavoille, C., Hanusse, N. and Perkovi¿, L., Plane spanners of maximum degree six. In: Lecture Notes in Computer Science, vol. 6198. Springer. pp. 19-30.
[3]
Bose, P., Gudmundsson, J. and Smid, M., Constructing plane spanners of bounded degree and low weight. In: Lecture Notes in Computer Science, vol. 2461. Springer. pp. 234-246.
[4]
Bose, P., Gudmundsson, J. and Smid, M., Constructing plane spanners of bounded degree and low weight. Algorithmica. v42 i3-4. 249-264.
[5]
Bose, P., Morin, P., Stojmenovic, I. and Urrutia, J., Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks. v7 i6. 609-616.
[6]
P. Bose, M. Smid, On plane geometric spanners: a survey and open problems, 2009. Available at: http://dept-info.labri.fr/~gavoille/lecture-articles/BS09a.
[7]
Bose, P., Smid, M. and Xu, D., Delaunay and diamond triangulations contain spanners of bounded degree. International Journal of Computational Geometry and Applications. v19 i2. 119-140.
[8]
P. Carmi, L. Chaitman, Bounded degree planar geometric spanner, 2010, Available at: http://arxiv4.library.cornell.edu/abs/1003.4963v1.
[9]
J. Chen, A. Jiang, I. Kanj, G. Xia, F. Zhang, Separability and topology control of quasi unit disk graphs, in: Proceedings of the IEEE Conference on Computer Communications, 2007, pp. 2225-2233.
[10]
Chen, J., Jiang, A., Kanj, I., Xia, G. and Zhang, F., Separability and topology control of quasi unit disk graphs. Wireless Networks. v17 i1. 53-67.
[11]
de~Berg, M., van Kreveld, M., Overmars, M. and Schwarzkopf, O., Computational Geometry: Algorithms and Applications. 2008. third edition. Springer-Verlag.
[12]
Gao, J., Guibas, L.J., Hershberger, J., Zhang, L. and Zhu, A., Geometric spanners for routing in mobile networks. IEEE Journal on Selected Areas in Communications. v23 i1. 174-185.
[13]
Gudmundsson, J., Levcopoulos, C. and Narasimhan, G., Fast greedy algorithms for constructing sparse geometric spanners. SIAM Journal on Computing. v31 i5. 1479-1500.
[14]
I. Kanj, L. Perkovi-, On geometric spanners of Euclidean and unit disk graphs, in: Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, 2008, pp. 409-420.
[15]
Kanj, I., Perkovic, L. and Xia, G., Local construction of near-optimal power spanners for wireless ad hoc networks. IEEE Transactions on Mobile Computation. v8 i4. 460-474.
[16]
Kanj, I., Perkovi¿, L. and Xia, G., On spanners and lightweight spanners of geometric graphs. SIAM Journal on Computing. v39 i6. 2132-2161.
[17]
Keil, J. and Gutwin, C., Classes of graphs which approximate the complete Euclidean graph. Discrete & Computational Geometry. v7. 13-28.
[18]
E. Kranakis, H. Singh, J. Urrutia, Compass routing on geometric networks, in: Proceedings of the 11th Canadian Conference on Computational Geometry, 1999, pp. 51-54.
[19]
X.-Y. Li, G. Calinescu, P.-J. Wan, Distributed construction of planar spanner and routing for ad hoc wireless networks, in: Proceedings of the IEEE Conference on Computer Communications, 2002.
[20]
Narasimhan, G. and Smid, M., Geometric Spanner Networks. 2007. Cambridge University Press.
[21]
D. Peleg, Distributed computing: a locality-sensitive approach, SIAM Monographs on Discrete Mathematis and Applications, 2000.
[22]
Wang, Y. and Li, X.-Y., Localized construction of bounded degree and planar spanner for wireless ad hoc networks. Mobile Networks and Applications. v11 i2. 161-175.
[23]
Yao, A.C.-C., On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing. v11 i4. 721-736.
Index Terms
- Improved local algorithms for spanner construction
Index terms have been assigned to the content through auto-classification.
Recommendations
Improved local algorithms for spanner construction
ALGOSENSORS'10: Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entitiesLet S be a set of n points in the plane, let ε 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 ...
On Spanners and Lightweight Spanners of Geometric Graphs
We consider the problem of computing spanners of Euclidean and unit disk graphs embedded in the two-dimensional Euclidean plane. We are particularly interested in spanners that possess useful properties such as planarity, bounded degree, and/or light ...
$(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
An {\em $(\alpha,\beta)$-spanner} of a graph G is a subgraph H such that $\mathit{dist}_H(u,w)\le \alpha\cdot \mathit{dist}t_G(u,w)+\beta$ for every pair of vertices u,w, where distG'(u,w) denotes the distance between two vertices u and v in G'. It is ...
Comments
Information & Contributors
Information
Published In
Copyright © Elsevier B.V. © 2011.
Publisher
Elsevier Science Publishers Ltd.
United Kingdom
Publication History
Published: 01 September 2012
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 16 Oct 2024
Other Metrics
Citations
Cited By
View all- Anderson FGhosh AGraham MMougeot LWisnosky D(2023)Bounded-Degree Plane Geometric Spanners in PracticeACM Journal of Experimental Algorithmics10.1145/358249728(1-36)Online publication date: 8-Apr-2023
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in