Online routing in triangulations?Public Deposited
Downloadable ContentDownload PDF
- Resource Type
We consider online routing strategies for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing strategies, one that works for all Delaunay triangulations and the other that works for all regular triangulations, (2) a randomized memoryless strategy that works for all triangulations, (3) an O(1) memory strategy that works for all convex subdivisions, (4) an O(1) memory strategy that approximates the shortest path in Delaunay triangulations, and (5) theoretical and experimental results on the competitiveness of these strategies.
- Bose, P, & Morin, P. (1999). Online routing in triangulations?. doi:10.1007/3-540-46632-0_12
- Date Created
- In Collection: