Abstract
The Yao and Theta graphs are defined for a given point set and a fixed integer k > 0. The space around each point is divided into k cones of equal angle, and each point is connected to a nearest neighbor in each cone. The difference between Yao and Theta graphs is in the way the nearest neighbor is defined: Yao graphs minimize the Euclidean distance between a point and its neighbor, and Theta graphs minimize the Euclidean distance between a point and the orthogonal projection of its neighbor on the bisector of the hosting cone. We prove that, corresponding to each edge of the Theta graph Θ6, there is a path in the Yao graph Y 6 whose length is at most 8.82 times the edge length. Combined with the result of Bonichon, Gavoille, Hanusse and Ilcinkas, who prove an upper bound of 2 on the stretch factor of Θ6, we obtain an upper bound of 17.7 on the stretch factor of Y 6.
Supported by NSF grant CCF-0728909.
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.
Similar content being viewed by others
References
Bonichon, N., Gavoille, C., Hanusse, N., Ilcinkas, D.: Connections between Theta-graphs, Delaunay triangulations, and orthogonal surfaces. In: 36th International Workshop on Graph-Theoretic Concepts in Computer Science (2010) (to appear); Also as Technical Report hal-00454565_v1, HAL (February 2010)
Bose, P., Damian, M., Douïeb, K., O’Rourke, J., Seamone, B., Smid, M.H.M., Wuhrer, S.: Pi/2-angle yao graphs are spanners. CoRR, abs/1001.2913 (2010)
Bose, P., Maheshwari, A., Narasimhan, G., Smid, M., Zeh, N.: Approximating geometric bottleneck shortest paths. Computational Geometry: Theory and Applications 29, 233–249 (2004)
Damian, M., Molla, N., Pinciu, V.: Spanner properties of π/2-angle yao graphs. In: Proc. of the 25th European Workshop on Computational Geometry, pp. 21–24 (March 2009)
Molla, N.: Yao spanners for wireless ad hoc networks. Technical report, M.S. Thesis, Department of Computer Science, Villanova University (December 2009)
Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, New York (2007)
Peleg, D.: Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Damian, M., Raudonis, K. (2010). Yao Graphs Span Theta Graphs. In: Wu, W., Daescu, O. (eds) Combinatorial Optimization and Applications. COCOA 2010. Lecture Notes in Computer Science, vol 6509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17461-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-17461-2_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17460-5
Online ISBN: 978-3-642-17461-2
eBook Packages: Computer ScienceComputer Science (R0)