π/2-ANGLE YAO GRAPHS ARE SPANNERS-Reference-Cited by-同舟云学术

π/2-ANGLE YAO GRAPHS ARE SPANNERS

Published:2012-02 Issue:01 Volume:22 Page:61-82
ISSN:0218-1959
Container-title:International Journal of Computational Geometry & Applications
language:en
Short-container-title:Int. J. Comput. Geom. Appl.

Author:

BOSE PROSENJIT¹,DAMIAN MIRELA²,DOUÏEB KARIM¹,O'ROURKE JOSEPH³,SEAMONE BEN⁴,SMID MICHIEL¹,WUHRER STEFANIE⁵

Affiliation:

1. School of Computer Science, Carleton University, Ottawa, Canada

2. Department of Computer Science, Villanova University, Villanova, USA

3. Department of Computer Science, Smith College, Northampton, USA

4. School of Mathematics and Statistics, Carleton University, Ottawa, Canada

5. Institute for Information Technology, National Research Council, Ottawa, Canada

Abstract

We show that the Yao graph Y4 in the L2 metric is a spanner with stretch factor [Formula: see text]. Enroute to this, we also show that the Yao graph [Formula: see text] in the L∞ metric is a plane spanner with stretch factor 8.

Publisher

World Scientific Pub Co Pte Lt

Subject

Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218195912600047

Reference3 articles.

1. Approximating geometric bottleneck shortest paths

2. On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Routing Among Convex Polygonal Obstacles in the Plane;International Journal of Foundations of Computer Science;2023-04-21

2. Emanation Graph: A Plane Geometric Spanner with Steiner Points;Graphs and Combinatorics;2023-03-31

3. A lower bound on the stretch factor of Yao graph Y₄;SCI IRAN;2022

4. Truly Optimal Euclidean Spanners;SIAM Journal on Computing;2022-03-31

5. Routing in polygonal domains;Computational Geometry;2020-04