On a family of strong geometric spanners that admit local routing strategies

Authors:
Prosenjit Bose;Paz Carmi;Mathieu Couture;Michiel Smid;Daming Xu
Affiliations:
School of Computer Science, Carleton University, Ottawa, Canada;School of Computer Science, Carleton University, Ottawa, Canada;School of Computer Science, Carleton University, Ottawa, Canada;School of Computer Science, Carleton University, Ottawa, Canada;School of Computer Science, Carleton University, Ottawa, Canada
Venue:
Computational Geometry: Theory and Applications
Year:
2011

Citing 7
Cited 0

Classes of graphs which approximate the complete Euclidean graph

Discrete & Computational Geometry
Approximating geometric bottleneck shortest paths

Computational Geometry: Theory and Applications
On the Spanning Ratio of Gabriel Graphs and beta-Skeletons

SIAM Journal on Discrete Mathematics
Geometric Spanner Networks

Geometric Spanner Networks
Empty region graphs

Computational Geometry: Theory and Applications
Principles of Ad-hoc Networking

Principles of Ad-hoc Networking
Half-space proximal: a new local test for extracting a bounded dilation spanner of a unit disk graph

OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a family of directed geometric graphs, whose vertices are points in R^d. The graphs G"@l^@q in this family depend on two real parameters @l and @q. For 12