Spanning Properties of Yao and 𝜃-Graphs in the Presence of Constraints
From MaRDI portal
Publication:5197491
DOI10.1142/S021819591950002XzbMath1430.68360arXiv1401.2127OpenAlexW2973401770MaRDI QIDQ5197491
André van Renssen, Prosenjit Bose
Publication date: 24 September 2019
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.2127
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (5)
Generalized sweeping line spanners ⋮ Generalized sweeping line spanners ⋮ Emanation graph: a plane geometric spanner with Steiner points ⋮ Bounded-degree spanners in the presence of polygonal obstacle ⋮ Constrained routing between non-visible vertices
Cites Work
- Unnamed Item
- On plane geometric spanners: a survey and open problems
- Theta-3 is connected
- Towards tight bounds on theta-graphs: more is not always better
- On sparse spanners of weighted graphs
- On plane constrained bounded-degree spanners
- Approximating geometric bottleneck shortest paths
- The \(\varTheta_5\)-graph is a spanner
- On the Stretch Factor of the Theta-4 Graph
- New and improved spanning ratios for Yao graphs
- π/2-Angle Yao Graphs Are Spanners
- YAO GRAPHS SPAN THETA GRAPHS
- Geometric Spanner Networks
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- Strong Connectivity in Directional Nearest-Neighbor Graphs
- π/2-ANGLE YAO GRAPHS ARE SPANNERS
This page was built for publication: Spanning Properties of Yao and 𝜃-Graphs in the Presence of Constraints
