On plane constrained bounded-degree spanners
DOI10.1007/s00453-018-0476-8zbMath1422.68242arXiv1704.03596OpenAlexW2881370671WikidataQ129643239 ScholiaQ129643239MaRDI QIDQ1739100
Rolf Fagerberg, Sander Verdonschot, André van Renssen, Prosenjit Bose
Publication date: 25 April 2019
Published in: Algorithmica, LATIN 2012: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.03596
Computational aspects related to convexity (52B55) 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 (15)
Cites Work
- On plane geometric spanners: a survey and open problems
- Constrained generalized Delaunay graphs are plane spanners
- On plane constrained bounded-degree spanners
- There are plane spanners of degree 4 and moderate stretch factor
- Degree four plane spanners: Simpler and better
- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
- Geometric Spanner Networks
- Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles
- Plane Spanners of Maximum Degree Six
- Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs
This page was built for publication: On plane constrained bounded-degree spanners