Abstract
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no memory and uses no randomization, (2) no equivalent result is possible for convex subdivisions, (3) there is no competitive online routing algorithm under the Euclidean distance metric in arbitrary triangulations, and (4) there is no competitive online routing algorithm under the link distance metric even when the input graph is restricted to be a Delaunay, greedy, or minimum-weight triangulation.
Cite
CITATION STYLE
Bose, P., Brodnik, A., Carlsson, S., Demaine, E. D., Fleischer, R., López-Ortiz, A., … Ian Munro, J. (2000). Online routing in convex subdivisions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1969, pp. 47–59). Springer Verlag. https://doi.org/10.1007/3-540-40996-3_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
