\(\delta \)-Greedy t-spanner
- First Online:
We introduce a new geometric spanner, \(\delta \)-Greedy, whose construction is based on a generalization of the known Path-Greedy and Gap-Greedy spanners. The \(\delta \)-Greedy spanner combines the most desirable properties of geometric spanners both in theory and in practice. More specifically, it has the same theoretical and practical properties as the Path-Greedy spanner: a natural definition, small degree, linear number of edges, low weight, and strong \((1+\varepsilon )\)-spanner for every \(\varepsilon >0\). The \(\delta \)-Greedy algorithm is an improvement over the Path-Greedy algorithm with respect to the number of shortest path queries and hence with respect to its construction time. We show how to construct such a spanner for a set of n points in the plane in \(O(n^2 \log n)\) time.
The \(\delta \)-Greedy spanner has an additional parameter, \(\delta \), which indicates how close it is to the Path-Greedy spanner on the account of the number of shortest path queries. For \(\delta = t\) the output spanner is identical to the Path-Greedy spanner, while the number of shortest path queries is, in practice, linear.
Finally, we show that for a set of n points placed independently at random in a unit square the expected construction time of the \(\delta \)-Greedy algorithm is \(O(n \log n)\). Our analysis indicates that the \(\delta \)-Greedy spanner gives the best results among the known spanners of expected \(O(n \log n)\) time for random point sets. Moreover, analysis implies that by setting \(\delta = t\), the \(\delta \)-Greedy algorithm provides a spanner identical to the Path-Greedy spanner in expected \(O(n \log n)\) time.
Unable to display preview. Download preview PDF.
- 2.Alewijnse, S.P.A., Bouts, Q.W., ten Brink, A.P., Buchin, K.: Distribution-sensitive construction of the greedy spanner. Algorithmica, 1–23 (2016)Google Scholar
- 3.Arya, S., Mount, D.M., Smid, M.H.M.: Randomized and deterministic algorithms for geometric spanners of small diameter. In FOCS, pp. 703–712 (1994)Google Scholar
- 4.Bar-On, G., Carmi, P.: \(\delta \)-greedy t-spanner. CoRR, abs/1702.05900 (2017)Google Scholar
- 6.Callahan, P.B.: Optimal parallel all-nearest-neighbors using the well-separated pair decomposition. In: FOCS, pp. 332–340 (1993)Google Scholar
- 7.Callahan, P.B., Kosaraju, S.R.: A decomposition of multi-dimensional point-sets with applications to k-nearest-neighbors and n-body potential fields. In: STOC, pp. 546–556 (1992)Google Scholar
- 8.Chandra, B.: Constructing sparse spanners for most graphs in higher dimensions. Inf. Process. Lett. 51(6), pp. 289–294 (1994)Google Scholar
- 10.Clarkson, K.L.: Approximation algorithms for shortest path motion planning. In STOC, pp. 56–65 (1987)Google Scholar
- 11.Das, G., Heffernan, P.J., Narasimhan, G.: Optimally sparse spanners in 3-dimensional Euclidean space. In SoCG, pp. 53–62 (1993)Google Scholar
- 15.Farshi, M., Gudmundsson, J.: Experimental study of geometric t-spanners. ACM Journal of Experimental Algorithmics 14 (2009)Google Scholar
- 20.Soares, J.: Approximating Euclidean distances by small degree graphs. Discrete & Computational Geometry 11(2), 213–233 (1994)Google Scholar