Online Routing in Triangulations (1999)
Cached
Download Links
- [www.scs.carleton.ca]
- [www.scs.carleton.ca]
- [cg.scs.carleton.ca]
- [www.scs.carleton.ca]
- [cg.scs.carleton.ca]
- [www.comp.nus.edu.sg]
- [graphics.stanford.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IN PROC. OF THE 10 TH ANNUAL INT. SYMP. ON ALGORITHMS AND COMPUTATION ISAAC |
| Citations: | 83 - 7 self |
BibTeX
@INPROCEEDINGS{Bose99onlinerouting,
author = {Prosenjit Bose and Pat Morin},
title = {Online Routing in Triangulations},
booktitle = {IN PROC. OF THE 10 TH ANNUAL INT. SYMP. ON ALGORITHMS AND COMPUTATION ISAAC},
year = {1999},
pages = {113--122},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
