Classes of graphs which approximate the complete Euclidean graph
Discrete & Computational Geometry
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
SIAM Journal on Computing
Constructing Plane Spanners of Bounded Degree and Low Weight
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
Mobile Networks and Applications
Geometric Spanner Networks
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Plane spanners of maximum degree six
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
On Spanners and Lightweight Spanners of Geometric Graphs
SIAM Journal on Computing
Diamond triangulations contain spanners of bounded degree
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Localized Delaunay triangulation with application in ad hoc wireless networks
IEEE Transactions on Parallel and Distributed Systems
On bounded degree plane strong geometric spanners
Journal of Discrete Algorithms
| Hi-index | 0.00 |
Let 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 that is a geometric spanner of G with stretch factor 2.86, and hence a geometric spanner of ε with stretch factor O(n lg n) time centralized algorithm for constructing a subgraph of G that is a geometric spanner of ε of degree at most 11 and stretch factor 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