Sciweavers

Share
ISAAC
1999
Springer

Online Routing in Triangulations

10 years 8 months ago
Online Routing in Triangulations
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorithms, one that works for all Delaunay triangulations and the other that works for all regular triangulations, (2) a randomized memoryless algorithm that works for all triangulations, (3) an O(1) memory algorithm that works for all convex subdivisions, (4) an O(1) memory algorithm that approximates the shortest path in Delaunay triangulations, and (5) theoretical and experimental results on the competitiveness of these algorithms. Key words. Routing, Online algorithms, Delaunay triangulations, shortest path, spanning path
Prosenjit Bose, Pat Morin
Added 04 Aug 2010
Updated 04 Aug 2010
Type Conference
Year 1999
Where ISAAC
Authors Prosenjit Bose, Pat Morin
Comments (0)
books