Online Routing in Convex Subdivisions (2000)
Cached
Download Links
- [www.scs.carleton.ca]
- [www.scs.carleton.ca]
- [solo.uwaterloo.ca]
- [cg.scs.carleton.ca]
- DBLP
Other Repositories/Bibliography
| Citations: | 33 - 4 self |
BibTeX
@MISC{Bose00onlinerouting,
author = {Prosenjit Bose and Andrej Brodnik and Svante Carlsson and Erik D. Demaine and Rudolf Fleischer and Alejandro López-Ortiz and Pat Morin and J. Ian Munro},
title = {Online Routing in Convex Subdivisions},
year = {2000}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
Citations
| 549 | R.: Online Computation and Competitive Analysis - Borodin, El-Yaniv - 1998 |
| 419 | Computational geometry - Preparata, Shamos - 1985 |
| 209 | Compass Routing On Geometric Networks - Kranakis, Singh, et al. - 1999 |
| 198 | An Efficient Algorithm for Determining the Convex Hull of a Finite Planar - Graham - 1972 |
| 127 | Shortest paths without a map - Papadimitriou, Yannakakis - 1991 |
| 83 | Online routing in triangulations - Bose, Morin - 2004 |
| 23 | Constructing competitive tours from local information - Kalyanasundaram, Pruhs - 1994 |
| 6 | Triangulations intersect nicely. Discrete and Computational Geometry - Aichholzer, Aurenhammer, et al. - 1996 |
| 2 | Competitive routing algorithms for greedy and minimum-weight triangulations - Bose, Morin - 2000 |
| 1 | Learning in navigation: Goal in graphs - Cucka, Netanyahu, et al. - 1996 |
