Compass routing on geometric networks.
Evangelos Kranakis, Harvinder Singh, Jorge Urrutia · 1999
In this paper we study local routing algorithms on geometric networks. Formally speaking, suppose that we want to travel from a vertex s to a vertex t of a geometric network. A routing algorithm is called a local routing algorithm if it satisfies the following conditions: