Online routing in triangulations?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1741, Issue , 1999, Pages 113-122

  Bose, Prosenjit ^a   Morin, Pat ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; ROUTING ALGORITHMS; SURVEYING;

DELAU-NAY TRIANGULATIONS; MEMORY STRATEGIES; MEMORYLESS; MEMORYLESS STRATEGIES; ONLINE ROUTING; PLANAR STRAIGHT-LINE GRAPHS; ROUTING STRATEGIES; SHORTEST PATH;

TRIANGULATION;

EID: 84958047717     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46632-0_12     Document Type: Conference Paper

References (13)

1. R. Baeza-Yates, J. Culberson, and G. Rawlins. Searching in the plane. Information and Computation, 106(2):234-252, 1993.
2. J. A. Bondy and U. S. R. Murty. Graph Theory with Applications. Elsevier North-Holland, 1976.
3. P. Bose and P. Morin. Online routing in triangulations. Available online at http://www.scs.carleton.ca/morin, 1999.
4. P. Bose, P. Morin, I. Stojmenović, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. In Proceedings of Discrete Algorithms and Methods for Mobility (DIALM'99), 1999. To appear.
5. V. Chvátal. A combinatorial theorem in plane geometry. Journal of Combinatorial Theory B, 18:39-41, 1975.
6. D. Dobkin, S. J. Friedman, and K. J. Supowit. Delaunay graphs are almost as good as complete graphs. Discrete and Computational Geometry, 5:399-407, 1990. See also 28th Symp. Found. Comp. Sci., 1987, pp. 20-26.
7. H. Edelsbrunner. An acyclicity theorem for cell complexes in d dimension. Combinatorica, 10(3):251-260, 1988.
8. R. Klein. Walking an unknown street with bounded detour. Computational Geometry Theory and Applications, 1:325-351, 1992.
9. E. Kranakis, H. Singh, and J. Urrutia. Compass routing on geometric networks. In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999. To appear.
10. X. Lin and I. Stojmenović. Geographic distance routing in ad hoc wireless networks. Technical Report TR-98-10, SITE, University of Ottawa, December 1998.
11. A. Okabe, B. Boots, and K. Sugihara. Spatial Tesselations: Concepts and Applications of Voronoi Diagrams. John Wiley and Sons, 1992.
12. Franco P. Preparata and Michael Ian Shamos. Computational Geometry. Springer-Verlag, New York, 1985.
13. Günter M. Ziegler. Lectures on Polytopes. Number 154 in Graduate Texts in Mathematics. Springer-Verlag, New York, 1994.