Compass routing on geometric graphs.

Abstract

In this thesis, we introduce a novel routing algorithm which we call "compass routing" to find paths between pairs of points in planar geometric graphs. Our main goal was that of developing, whenever possible, routing algorithms that, using only "local information", the position of our destination and a finite amount of extra memory, find a path from a starting position to our destination. We developed "compass routing" based routing algorithms for trees, Delaunay triangulations and orthogonal convexly embedded geometric graphs. Several related results on various types of geometric graphs were also studied.