Succinct Greedy Geometric Routing in the Euclidean Plane

* Final gross prices may vary according to local VAT.

Get Access

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.

This work was supported by NSF grants 0724806, 0713046, 0830403, and ONR grant N00014-08-1-1015.