Online routing in convex subdivisions

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

Volumn 1969, Issue , 2000, Pages 47-59

  Bose, Prosenjit ^a   Brodnik, Andrej ^b   Carlsson, Svante ^c   Demaine, Erik D ^d   Fleischer, Rudolf ^d   López Ortiz, Alejandro ^e   Morin, Pat ^a   Ian Munro, J ^d  

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITY OF LJUBLJANA   (Slovenia)

^c University of Karlskona/Ronneby   (Sweden)

^d UNIVERSITY OF WATERLOO   (Canada)

^e UNIVERSITY OF NEW BRUNSWICK   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DELAUNAY; EUCLIDEAN DISTANCE; FINDING PATHS; INPUT GRAPHS; LINK DISTANCE; MINIMUM WEIGHT TRIANGULATION; ONLINE ROUTING; PLANE GRAPHS;

TRIANGULATION;

EID: 84949797512     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40996-3_5     Document Type: Conference Paper

References (10)

1. O. Aichholzer, F. Aurenhammer, S.-W. Cheng, N. Katoh, G. Rote, M. Taschwer, and Y.-F. Xu. Triangulations intersect nicely. Discrete and Computational Geometry, 16(4):339-359, 1996.
2. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
3. P. Bose and P. Morin. Online routing in triangulations. In Proceedings of the Tenth International Symposium on Algorithms and Computation (ISAAC'99), volume 1741 of Springer LNCS, pages 113-122, 1999.
4. P. Bose and P. Morin. Competitive routing algorithms for greedy and minimum-weight triangulations. Manuscript, 2000.
5. P. Cucka, N. S. Netanyahu, and A. Rosenfeld. Learning in navigation: Goal finding in graphs. International Journal of Pattern Recognition and Artificial Intelligence, 10(5):429-446, 1996.
6. R. L. Graham. An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters, 1:132-133, 1972.
7. B. Kalyanasundaram and K. R. Pruhs. Constructing competitive tours from local information. Theoretical Computer Science, 130:125-138, 1994.
8. 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.
9. C. H. Papadimitriou and M. Yannakakis. Shortest paths without a map. Theoretical Computer Science, 84:127-150, 1991.
10. F. P. Preparata and M. I. Shamos. Computational Geometry. Springer-Verlag, New York, 1985.