| Online Routing in Convex Subdivisions (2002) | |||||||||||||||
Abstract | |||||||||||||||
| We consider online routing algorithms for nding 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. | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||