Bounded-degree spanners in the presence of polygonal obstacle
DOI10.1016/J.TCS.2020.12.024zbMATH Open1477.68245OpenAlexW4206835255MaRDI QIDQ2220871FDOQ2220871
Authors: André van Renssen, Gladys Wong 
Publication date: 25 January 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.12.024
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Vertex degrees (05C07) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Geometric Spanner Networks
- On plane geometric spanners: a survey and open problems
- Lower bounds on the dilation of plane spanners
- Constrained generalized Delaunay graphs are plane spanners
- Routing in polygonal domains
- There are plane spanners of degree 4 and moderate stretch factor
- Towards plane spanners of degree 3
- Degree four plane spanners: simpler and better
- Bounded-degree spanners in the presence of polygonal obstacles
- Competitive local routing with constraints
- Spanning properties of Yao and \(\theta\)-graphs in the presence of constraints
- Routing on the Visibility Graph
Cited In (6)
- Efficient construction of a bounded-degree spanner with low weight
- DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE
- Generalized sweeping line spanners
- EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER
- Generalized sweeping line spanners
- Spanners for geodesic graphs and visibility graphs
This page was built for publication: Bounded-degree spanners in the presence of polygonal obstacle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220871)
