New and Improved Spanning Ratios for Yao Graphs
@inproceedings{Barba2014NewAI, title={New and Improved Spanning Ratios for Yao Graphs}, author={L. Barba and P. Bose and M. Damian and R. Fagerberg and Wah Loon Keng and J. O’Rourke and Andr{\'e} van Renssen and Perouz Taslakian and S. Verdonschot and Ge Xia}, booktitle={Symposium on Computational Geometry}, year={2014} }
For a set of points in the plane and a fixed integer k > 0, the Yao graph Yk partitions the space around each point into k equiangular cones of angle &thetas; = 2π/k, and connects each point to a nearest neighbor in each cone. It is known for all Yao graphs, with the sole exception of Y5, whether or not they are geometric spanners. In this paper we close this gap by showing that for odd k ≥ 5, the spanning ratio of Yk is at most 1/(1−2sin(3&thetas;/8)), which gives the first constant upper… CONTINUE READING
Supplemental Presentations
Figures, Tables, and Topics from this paper
25 Citations
Truly Optimal Euclidean Spanners
- Mathematics, Computer Science
- 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
- 2019
- 10
- PDF
Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations
- Mathematics, Computer Science
- ArXiv
- 2015
- 1
- PDF
Optimal local routing on Delaunay triangulations defined by empty equilateral triangles
- Computer Science, Mathematics
- SIAM J. Comput.
- 2015
- 22
- PDF
References
SHOWING 1-7 OF 7 REFERENCES
On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- Mathematics, Computer Science
- SIAM J. Comput.
- 1982
- 621
- Highly Influential
- PDF
Approximation algorithms for shortest path motion planning
- Mathematics, Computer Science
- STOC '87
- 1987
- 247
- Highly Influential
Raudonis. Yao graphs span theta graphs
- Discrete Mathematics, Algorithms and Applications,
- 2012
Yao graphs are spanners. CoRR, abs
- Yao graphs are spanners. CoRR, abs
- 1001