Compass routing on geometric graphs.

Harvinder. Singh
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...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.