Online Routing in Triangulations

  • Prosenjit Bose
  • Pat Morin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1741)


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 tri- angulations, (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 short- est path in Delaunay triangulations, and (5) theoretical and experimental results on the competitiveness of these strategies.


Voronoi Diagram Competitive Ratio Delaunay Triangulation Memory Strategy Voronoi Region 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R. Baeza-Yates, J. Culberson, and G. Rawlins. Searching in the plane. Information and Computation, 106(2):234–252, 1993.MATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    J. A. Bondy and U. S. R. Murty. Graph Theory with Applications. Elsevier North-Holland, 1976.Google Scholar
  3. [3]
    P. Bose and P. Morin. Online routing in triangulations. Available online at morin, 1999.
  4. [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.Google Scholar
  5. [5]
    V. Chvátal. A combinatorial theorem in plane geometry. Journal of Combinatorial Theory B, 18:39–41, 1975.MATHCrossRefGoogle Scholar
  6. [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.MATHCrossRefMathSciNetGoogle Scholar
  7. [7]
    H. Edelsbrunner. An acyclicity theorem for cell complexes in d dimension. Combinatorica, 10(3):251–260, 1988.CrossRefMathSciNetGoogle Scholar
  8. [8]
    R. Klein. Walking an unknown street with bounded detour. Computational Geometry Theory and Applications, 1:325–351, 1992.MATHMathSciNetGoogle Scholar
  9. [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.Google Scholar
  10. [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.Google Scholar
  11. [11]
    A. Okabe, B. Boots, and K. Sugihara. Spatial Tesselations: Concepts and Applications of Voronoi Diagrams. John Wiley and Sons, 1992.Google Scholar
  12. [12]
    Franco P. Preparata and Michael Ian Shamos. Computational Geometry. Springer-Verlag, New York, 1985.Google Scholar
  13. [13]
    Günter M. Ziegler. Lectures on Polytopes. Number 154 in Graduate Texts in Mathematics. Springer-Verlag, New York, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Prosenjit Bose
    • 1
  • Pat Morin
    • 1
  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada

Personalised recommendations