Sciweavers

ISAAC
2000
Springer

Online Routing in Convex Subdivisions

13 years 7 months ago
Online Routing in Convex Subdivisions
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.
Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante
Added 25 Aug 2010
Updated 25 Aug 2010
Type Conference
Year 2000
Where ISAAC
Authors Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, Alejandro López-Ortiz
Comments (0)