Compass routing on geometric graphs.

dc.contributor.advisor	Urrutia, J.,
dc.contributor.author	Singh, Harvinder.
dc.date.accessioned	2009-03-23T17:40:22Z
dc.date.available	2009-03-23T17:40:22Z
dc.date.created	1999
dc.date.issued	1999
dc.degree.level	Masters
dc.degree.name	M.C.S.
dc.description.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.
dc.format.extent	77 p.
dc.identifier.citation	Source: Masters Abstracts International, Volume: 38-03, page: 0731.
dc.identifier.isbn	9780612452503
dc.identifier.uri	http://hdl.handle.net/10393/8932
dc.identifier.uri	http://dx.doi.org/10.20381/ruor-7564
dc.publisher	University of Ottawa (Canada)
dc.subject.classification	Computer Science.
dc.title	Compass routing on geometric graphs.
dc.type	Thesis

Files

Now showing 1 - 1 of 1