Abstract
Given a set of points in the plane, we show that the θ-graph with 5 cones is a geometric spanner with spanning ratio at most \(\sqrt{50 + 22\sqrt{5}}\) ≈ 9.960 . This is the first constant upper bound on the spanning ratio of this graph. The upper bound uses a constructive argument, giving a, possibly self-intersecting, path between any two vertices, whose length is at most \(\sqrt{50 + 22 \sqrt{5}}\) times the Euclidean distance between the vertices. We also give a lower bound on the spanning ratio of \(1\over2\) (11\(\sqrt{5}\)-17) ≈ 3.798.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press (2007)
Clarkson, K.: Approximation algorithms for shortest path motion planning. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC 1987), pp. 56–65 (1987)
Keil, J.: Approximating the complete Euclidean graph. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol. 318, pp. 208–213. Springer, Heidelberg (1988)
Ruppert, J., Seidel, R.: Approximating the d-dimensional complete Euclidean graph. In: Proceedings of the 3rd Canadian Conference on Computational Geometry (CCCG 1991), pp. 207–210 (1991)
Bonichon, N., Gavoille, C., Hanusse, N., Ilcinkas, D.: Connections between theta-graphs, Delaunay triangulations, and orthogonal surfaces. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 266–278. Springer, Heidelberg (2010)
El Molla, N.M.: Yao spanners for wireless ad hoc networks. Master’s thesis, Villanova University (2009)
Barba, L., Bose, P., De Carufel, J.-L., van Renssen, A., Verdonschot, S.: On the stretch factor of the theta-4 graph. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 109–120. Springer, Heidelberg (2013)
Rysavy, P.: Wireless broadband and other fixed-wireless systems, http://www.networkcomputing.com/netdesign/bb1.html (accessed December 3, 2012)
SATEL Oy. What is a radio modem?, http://www.satel.com/products/what-is-a-radio-modem (accessed December 3, 2012)
Morin, P., Verdonschot, S.: On the average number of edges in theta graphs. CoRR, abs/1304.3402 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bose, P., Morin, P., van Renssen, A., Verdonschot, S. (2013). The θ 5-Graph is a Spanner. In: Brandstädt, A., Jansen, K., Reischuk, R. (eds) Graph-Theoretic Concepts in Computer Science. WG 2013. Lecture Notes in Computer Science, vol 8165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45043-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-45043-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45042-6
Online ISBN: 978-3-642-45043-3
eBook Packages: Computer ScienceComputer Science (R0)