Efficient Construction of Low Weight Bounded Degree Planar Spanner

Given a set V of n points in a two-dimensional plane, we give an O(n log n)-time centralized algorithm that constructs a planar t-spanner for V, for t le; max{π/2, π sin α/2 + 1} ċ Cdel, such that the degree of each node is bounded from above by 19 + ⌈2π/α⌉, and the total edge length is proportional to the weight of the minimum spanning tree of V, where 0 < α < π/2 is an adjustable parameter. Here Cdel is the spanning ratio of the Delaunay triangulation, which is at most 4√3/9 π. Moreover, we show that our method can be extended to construct a planar bounded degree spanner for unit disk graphs with the adjustable parameter α satisfying 0 < α < π/3. This method can be converted to a localized algorithm where the total number of messages sent by all nodes is at most O(n) (under broadcasting communication model). These constants are all worst case constants due to our proofs. Previously, only centralized method [1] of constructing bounded degree planar spanner is known, with degree bound 27 and spanning ratio t ≃ 10.02. The distributed implementation of this centralized method takes O(n2) communications in the worst case.

[1]  R. Sokal,et al.  A New Statistical Approach to Geographic Variation Analysis , 1969 .

[2]  David G. Kirkpatrick,et al.  On the Spanning Ratio of Gabriel Graphs and beta-skeletons , 2002, LATIN.

[3]  Xiang-Yang Li,et al.  Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks , 2003, DIALM-POMC '03.

[4]  Carl Gutwin,et al.  Classes of graphs which approximate the complete euclidean graph , 1992, Discret. Comput. Geom..

[5]  Godfried T. Toussaint,et al.  Relative neighborhood graphs and their relatives , 1992, Proc. IEEE.

[6]  Prosenjit Bose,et al.  Online Routing in Triangulations , 1999, SIAM J. Comput..

[7]  Andrzej Lingas,et al.  Minimum Spanning Trees , 2022 .

[8]  Joachim Gudmundsson,et al.  Constructing Plane Spanners of Bounded Degree and Low Weight , 2002, ESA.

[9]  Giri Narasimhan,et al.  New sparseness results on graph spanners , 1992, SCG '92.

[10]  Gautam Das,et al.  WHICH TRIANGULATIONS APPROXIMATE THE COMPLETE GRAPH? , 2022 .

[11]  David P. Dobkin,et al.  Delaunay graphs are almost as good as complete graphs , 1990, Discret. Comput. Geom..

[12]  Xiang-Yang Li,et al.  Distributed construction of a planar spanner and routing for ad hoc wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[13]  Tamás Lukovszki,et al.  New Results of Fault Tolerant Geometric Spanners , 1999, WADS.

[14]  David Eppstein.  Beta-skeletons have unbounded dilation , 2002, Comput. Geom..

[15]  Joachim Gudmundsson,et al.  Improved Greedy Algorithms for Constructing Sparse Geometric Spanners , 2000, SWAT.

[16]  Carl Gutwin,et al.  The Delauney Triangulation Closely Approximates the Complete Euclidean Graph , 1989, WADS.

[17]  Joachim Gudmundsson,et al.  Ordered theta graphs , 2004, CCCG.

[18]  Giri Narasimhan,et al.  A Fast Algorithm for Constructing Sparse Euclidean Spanners , 1997, Int. J. Comput. Geom. Appl..

[19]  Michiel H. M. Smid,et al.  Euclidean spanners: short, thin, and lanky , 1995, STOC '95.