Succinct greedy geometric routing in the Euclidean plane
MT Goodrich, D Strash - International Symposium on Algorithms and …, 2009 - Springer
International Symposium on Algorithms and Computation, 2009•Springer
Succinct Greedy Geometric Routing in the Euclidean Plane Page 1 Succinct Greedy Geometric
Routing in the Euclidean Plane * Michael T. Goodrich and Darren Strash Computer Science
Department, University of California, Irvine, USA Abstract. We show that greedy geometric
routing schemes exist for the Euclidean metric in R2 , for 3-connected planar graphs, with
coordinates that can be represented succinctly, that is, with O(log n) bits, where n is the number
of vertices in the graph. 1 Introduction Geometric routing algorithms perform message passing …
Routing in the Euclidean Plane * Michael T. Goodrich and Darren Strash Computer Science
Department, University of California, Irvine, USA Abstract. We show that greedy geometric
routing schemes exist for the Euclidean metric in R2 , for 3-connected planar graphs, with
coordinates that can be represented succinctly, that is, with O(log n) bits, where n is the number
of vertices in the graph. 1 Introduction Geometric routing algorithms perform message passing …
Abstract
We show that greedy geometric routing schemes exist for the Euclidean metric in R2, 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.
Springer