Online routing in triangulations

SIAM Journal on Computing

Volumn 33, Issue 4, 2004, Pages 937-951

  Bose, Prosenjit ^a   Morin, Pat ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

Delaunay triangulations; Online algorithms; Routing; Shortest path; Spanning path

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FUNCTIONS; GEOGRAPHIC INFORMATION SYSTEMS; GRAPH THEORY; PACKET NETWORKS; STORAGE ALLOCATION (COMPUTER); TRIANGULATION;

DELAUNAY TRIANGULATIONS; ONLINE ALGORITHMS; ROUTING; SHORTEST PATH (SP); SPANNING PATH;

COMPUTATIONAL COMPLEXITY;

EID: 4444219874     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539700369387     Document Type: Article

References (18)

1. R. BAEZA-YATES, J. CULBERSON, AND G. RAWLINS, Searching in the plane, Inform, and Cornput., 106 (1993), pp. 234-252.
2. J. A. BONDY AND U. S. R. MURTY, Graph Theory with Applications, American Elsevier, New York, 1976.
3. A. BORODIN AND R. EL-YANIV, Online Computation and Competitive Analysis, Cambridge University Press, Cambridge, UK, 1998.
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), ACM, New York, 1999, pp. 48-55.
5. V. CHVÁTAL, A combinatorial theorem in plane geometry, J. Combin. Theory Ser. B, 18 (1975), pp. 39-41.
6. M. DE BERG, M. VAN KREVELD, R. VAN OOSTRUM, AND M. OVERMARS, Simple traversal of a subdivision without extra storage, Internat. J. Geographic Inform. Systems, 11 (1997), pp. 359-373.
7. D. DOBKIN, S. J. FRIEDMAN, AND K. J. SUPOWIT, Delaunay graphs are almost as good as complete graphs, Discrete Comput. Geom., 5 (1990), pp. 399-407.
8. H. EDELSBRUNNER, An acyclicity theorem for cell complexes in d dimension, Combinatorica, 10 (1988), pp. 251-260.
9. S. K. GHOSH AND S. SALUJA, Optimal on-line algorithms for walking with minimum number of turns in unknown streets, Comput. Geom., 8 (1997), pp. 241-266.
10. C. ICKING AND R. KLEIN, Searching for the kernel of a polygon: A competitive strategy, in Proceedings of the 11th Annual ACM Symposium on Computational Geometry, ACM, New York, 1995, pp. 258-266.
11. J. M. KEIL AND C. A. GUTWIN, Classes of graphs which approximate the complete Euclidean graph, Discrete Comput. Geom., 7 (1992), pp. 13-28.
12. R. KLEIN, Walking an unknown street with bounded detour, Comput. Geom., 1 (1992), pp. 325-351.
13. 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, pp. 51-54; available online from http://www.cccg.ca/ proceedings/1999/.
14. 1 surface interpolation, in Mathematical Software III, Academic Press, New York, 1977, pp. 161-194.
15. X. LIN AND I. STOJMENOVIC, Geographic Distance Routing in Ad Hoc Wireless Networks, Tech. Report TR-98-10, SITE, University of Ottawa, Canada, 1998.
16. A. OKABE, B. BOOTS, AND K. SUGIHARA, Spatial Tesselations: Concepts and Applications of Voronoi Diagrams, John Wiley and Sons, New York, 1992.
17. F. P. PREPARATA AND M. I. SHAMOS, Computational Geometry, Springer-Verlag, New York, 1985.
18. G. M. ZIEGLER, Lectures on Polytopes, Grad. Texts in Math. 154, Springer-Verlag, New York, 1994.