Succinct Greedy Geometric Routing in the Euclidean Plane

Authors:
Michael T. Goodrich;Darren Strash
Affiliations:
Computer Science Department, University of California, Irvine, USA;Computer Science Department, University of California, Irvine, USA
Venue:
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Year:
2009

Citing 8
Cited 15

A data structure for dynamic trees

Journal of Computer and System Sciences
On a conjecture related to geometric routing

Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
A Distributed Geometric Routing Algorithm for Ad HocWireless Networks

ITNG '07 Proceedings of the International Conference on Information Technology
Greedy drawings of triangulations

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Some Results on Greedy Embeddings in Metric Spaces

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Succinct Greedy Graph Drawing in the Hyperbolic Plane

Graph Drawing
An Algorithm to Construct Greedy Drawings of Triangulations

Graph Drawing
On the efficiency of a local iterative algorithm to compute Delaunay realizations

WEA'08 Proceedings of the 7th international conference on Experimental algorithms

A generalized greedy routing algorithm for 2-connected graphs

Theoretical Computer Science
Greedy routing via embedding graphs onto semi-metric spaces

FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Competitive routing in the half-θ6-graph

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Embedding stacked polytopes on a polynomial-size grid

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On succinct convex greedy drawing of 3-connected plane graphs

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A lower bound on greedy embedding in euclidean plane

GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
Schnyder greedy routing algorithm

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Succinct greedy drawings do not always exist

Networks
Shifting strategy for geometric graphs without geometry

Journal of Combinatorial Optimization
Succinct strictly convex greedy drawing of 3-connected plane graphs

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Self-approaching graphs

GD'12 Proceedings of the 20th international conference on Graph Drawing
An optimal greedy routing algorithm for triangulated polygons

Computational Geometry: Theory and Applications
A simple routing algorithm based on Schnyder coordinates

Theoretical Computer Science
Greedy routing via embedding graphs onto semi-metric spaces

Theoretical Computer Science
Category-based routing in social networks: Membership dimension and the small-world phenomenon

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that greedy geometric routing schemes exist for the Euclidean metric in R 2, for 3-connected planar graphs, with coordinates that can be represented succinctly, that is, with O(logn) bits, where n is the number of vertices in the graph.