Continuous Yao graphs
Authors:
- Davood BakhsheshDBDavood Bakhshesh
- Luis BarbaLBLuis Barba
- Prosenjit BosePBProsenjit Bose
- Jean-Lou De CarufelJCJean-Lou De Carufel
- Mirela DamianMDMirela Damian
- Rolf FagerbergRFRolf Fagerberg
- Mohammad FarshiMFMohammad Farshi
- André van RenssenARAndré van Renssen
- Perouz TaslakianPTPerouz Taslakian
- Sander VerdonschotSVSander Verdonschot
- 1 January 2018
- journal article
- research article
- Published by Elsevier in Computational Geometry
- Vol. 67, 42-52
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- ETH Postdoctoral Fellowship
- NSERC
- NSF (CCF-1218814)
- Danish Council for Independent Research Natural Sciences (DFF-1323-00247)
- ERATO (JPMJER1201)
This publication has 9 references indexed in Scilit:
- Increasing-Chord Graphs On Point SetsJournal of Graph Algorithms and Applications, 2015
- YAO GRAPHS SPAN THETA GRAPHSDiscrete Mathematics, Algorithms and Applications, 2012
- π/2-ANGLE YAO GRAPHS ARE SPANNERSInternational Journal of Computational Geometry & Applications, 2012
- Region-Fault Tolerant Geometric SpannersDiscrete & Computational Geometry, 2009
- Approximating geometric bottleneck shortest pathsComputational Geometry, 2004
- Improved Algorithms for Constructing Fault-Tolerant SpannersAlgorithmica, 2002
- On sparse spanners of weighted graphsDiscrete & Computational Geometry, 1993
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related ProblemsSIAM Journal on Computing, 1982
- Strong Connectivity in Directional Nearest-Neighbor GraphsSIAM Journal on Algebraic Discrete Methods, 1981