Abstract
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.
Cite
CITATION STYLE
Bose, P., & Morin, P. (1999). Online routing in triangulations? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1741, pp. 113–122). Springer Verlag. https://doi.org/10.1007/3-540-46632-0_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
