On a family of strong geometric spanners that admit local routing strategies
DOI10.1016/J.COMGEO.2011.01.002zbMath1408.05092OpenAlexW2551288033MaRDI QIDQ551501
Prosenjit Bose, Mathieu Couture, Daming Xu, Paz Carmi, Michiel H. M. Smid
Publication date: 20 July 2011
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2011.01.002
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Empty region graphs
- Classes of graphs which approximate the complete Euclidean graph
- Approximating geometric bottleneck shortest paths
- On the Spanning Ratio of Gabriel Graphs and beta-Skeletons
- Geometric Spanner Networks
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- Online Routing in Triangulations
- ONLINE ROUTING IN CONVEX SUBDIVISIONS
This page was built for publication: On a family of strong geometric spanners that admit local routing strategies
