Abstract
The well-separated pair decomposition (WSPD) of the complete Euclidean graph defined on points in \(\mathbb {R}^2\) (Callahan and Kosaraju [JACM, 42 (1): 67-90, 1995]) is a technique for partitioning the edges of the complete graph based on length into a linear number of sets. Among the many different applications of WSPDs, Callahan and Kosaraju proved that the sparse subgraph that results by selecting an arbitrary edge from each set (called WSPD-spanner) is a \(1+8/(s-4)\)-spanner, where \(s>4\) is the separation ratio used for partitioning the edges.
Although competitive local-routing strategies exist for various spanners such as Yao-graphs, \(\varTheta \)-graphs, and variants of Delaunay graphs, few local-routing strategies are known for any WSPD-spanner. Our main contribution is a local-routing algorithm with a near-optimal competitive routing ratio of \(1+O(1/s)\) on a WSPD-spanner. Specifically, we present a 2-local and a 1-local routing algorithm on a WSPD-spanner with competitive routing ratios of \(1+6/(s-2)+4/s\) and \(1+6/(s-2)+6/s+4/(s^2-2s)+8/{s^2}\), respectively.
Research supported in part by NSERC and OGS.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bonichon, N., Bose, P., De Carufel, J.-L., Perković, L., van Renssen, A.: Upper and lower bounds for online routing on Delaunay triangulations. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 203–214. Springer, Heidelberg (2015). doi:10.1007/978-3-662-48350-3_18
Bose, P., Devroye, L., Löffler, M., Snoeyink, J., Verma, V.: Almost all Delaunay triangulations have stretch factor greater than pi/2. Comput. Geom. 44(2), 121–127 (2011)
Bose, P., Fagerberg, R., van Renssen, A., Verdonschot, S.: Optimal local routing on Delaunay triangulations defined by empty equilateral triangles. SIAM J. Comput. 44(6), 1626–1649 (2015)
Bose, P., Morin, P.: Online routing in triangulations. SIAM J. Comput. 33(4), 937–951 (2004)
Callahan, P.B., Kosaraju, S.R.: Faster algorithms for some geometric graph problems in higher dimensions. In: SODA, pp. 291–300 (1993)
Callahan, P.B., Kosaraju, S.R.: A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM 42(1), 67–90 (1995)
Chew, P.: There is a planar graph almost as good as the complete graph. In: SOCG, pp. 169–177 (1986)
Dobkin, D.P., Friedman, S.J., Supowit, K.J.: Delaunay graphs are almost as good as complete graphs. Discrete Comput. Geom. 5, 399–407 (1990)
Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P.: Routing in unit disk graphs. In: Kranakis, E., Navarro, G., Chávez, E. (eds.) LATIN 2016. LNCS, vol. 9644, pp. 536–548. Springer, Heidelberg (2016). doi:10.1007/978-3-662-49529-2_40
Keil, J.M., Gutwin, C.A.: Classes of graphs which approximate the complete euclidean graph. Discrete Comput. Geom. 7, 13–28 (1992)
Misra, S., Woungang, I., Misra, S.C.: Guide to Wireless Sensor Networks, 1st edn. Springer Publishing Company, Incorporated (2009)
Narasimhan, G., Smid, M.H.M.: Geometric spanner networks. Cambridge University Press (2007)
Xia, G.: The stretch factor of the Delaunay triangulation is less than 1.998. SIAM J. Comput. 42(4), 1620–1659 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Bose, P., De Carufel, JL., Dujmović, V., Paradis, F. (2017). Local Routing in Spanners Based on WSPDs. In: Ellen, F., Kolokolova, A., Sack, JR. (eds) Algorithms and Data Structures. WADS 2017. Lecture Notes in Computer Science(), vol 10389. Springer, Cham. https://doi.org/10.1007/978-3-319-62127-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-62127-2_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62126-5
Online ISBN: 978-3-319-62127-2
eBook Packages: Computer ScienceComputer Science (R0)