Continuous Yao Graphs
Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf, Fagerberg, Andr\'e van Renssen, Perouz Taslakian, Sander Verdonschot

TL;DR
This paper introduces continuous Yao graphs, a variation of Yao graphs, and analyzes their spanning properties, showing they are spanners for certain angles but not others, with implications for geometric network design.
Contribution
The paper defines continuous Yao graphs and proves they are spanners for angles up to 2π/3 using a new algebraic technique, expanding understanding of geometric spanners.
Findings
cY(θ) is a spanner for θ ≤ 2π/3
cY(π) is not a spanner
cY(θ) may be disconnected for θ > π
Abstract
In this paper, we introduce a variation of the well-studied Yao graphs. Given a set of points and an angle , we define the continuous Yao graph with vertex set and angle as follows. For each , we add an edge from to in if there exists a cone with apex and aperture such that is the closest point to inside this cone. We study the spanning ratio of for different values of . Using a new algebraic technique, we show that is a spanner when . We believe that this technique may be of independent interest. We also show that is not a spanner, and that may be disconnected for .
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.
Taxonomy
TopicsAdvanced Graph Theory Research · Advanced Combinatorial Mathematics · Computational Geometry and Mesh Generation
