New and Improved Spanning Ratios for Yao Graphs
Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg and, Wah Loon Keng, Joseph O'Rourke, Andr\'e van Renssen, Perouz, Taslakian, Sander Verdonschot, Ge Xia

TL;DR
This paper establishes new upper bounds on the spanning ratios of Yao graphs for various k, notably providing the first constant bound for Y_5 and improving bounds for Y_6, advancing understanding of their geometric spanner properties.
Contribution
It introduces the first constant upper bound for Y_5's spanning ratio, improves bounds for Y_6, and reveals a separation between Yao and Theta graphs with the same number of cones.
Findings
Upper bound for Y_5's spanning ratio is approximately 3.74.
Reduced Y_6's spanning ratio from 17.6 to 5.8.
Established a lower bound of 2.87 for Y_5.
Abstract
For a set of points in the plane and a fixed integer , the Yao graph partitions the space around each point into equiangular cones of angle , and connects each point to a nearest neighbor in each cone. It is known for all Yao graphs, with the sole exception of , whether or not they are geometric spanners. In this paper we close this gap by showing that for odd , the spanning ratio of is at most , which gives the first constant upper bound for , and is an improvement over the previous bound of for odd . We further reduce the upper bound on the spanning ratio for from to , which falls slightly below the lower bound of established for the spanning ratio of (-graphs differ from Yao graphs only in the way they…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
