Skip to main content
SpringerLink
Log in

Online Routing in Convex Subdivisions

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1969))

Included in the following conference series:

Abstract

We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no memory and uses no randomization, (2) no equivalent result is possible for convex subdivisions, (3) there is no competitive online routing algorithm under the Euclidean distance metric in arbitrary triangulations, and (4) there is no competitive online routing algorithm under the link distance metric even when the input graph is restricted to be a Delaunay, greedy, or minimum-weight triangulation.

This research was partly funded by the Natural Sciences and Engineering Research Council of Canada.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Article  MATH  MathSciNet  Google Scholar 

  2. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.

    Google Scholar 

  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.

    Google Scholar 

  4. P. Bose and P. Morin. Competitive routing algorithms for greedy and minimum-weight triangulations. Manuscript, 2000.

    Google Scholar 

  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.

    Article  Google Scholar 

  6. R. L. Graham. An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters, 1:132–133, 1972.

    Article  MATH  Google Scholar 

  7. B. Kalyanasundaram and K. R. Pruhs. Constructing competitive tours from local information. Theoretical Computer Science, 130:125–138, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  9. C. H. Papadimitriou and M. Yannakakis. Shortest paths without a map. Theoretical Computer Science, 84:127–150, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  10. F. P. Preparata and M. I. Shamos. Computational Geometry. Springer-Verlag, New York, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Colonel By Dr., K1S 5B6, Ottawa, Ontario, Canada

    Prosenjit Bose & Pat Morin

  2. IMFM, University of Ljubljana, Jadranska 11, SI-1111, Ljubljana, Slovenia

    Andrej Brodnik

  3. University of Karlskona/Ronneby, 371 41, KARLSKRONA, Sweden

    Svante Carlsson

  4. Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    Erik D. Demaine, Rudolf Fleischer & J.Ian Munro

  5. Faculty of Computer Science, University of New Brunswick, E3B 4A1, Fredericton, New Brunswick, Canada

    Alejandro López-Ortiz

Authors
  1. Prosenjit Bose
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrej Brodnik
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Svante Carlsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Erik D. Demaine
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Rudolf Fleischer
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Alejandro López-Ortiz
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Pat Morin
    View author publications

    You can also search for this author in PubMed Google Scholar

  8. J.Ian Munro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Karlsruhe University, Germany

    Gerhard Goos

  2. Cornell University, NY, USA

    Juris Hartmanis

  3. Utrecht University, The Netherlands

    Jan van Leeuwen

  4. Academia Sinica, Institute of Information Science, 128 Academia Road, Section 2, Nankang, 115, Taipei, Taiwan, R.O.C.

    D. T. Lee

  5. Department of Computer Science and Akamai Technologies, University of Illinois at Urbana Champaign, 500 Technology Square, 02139, Cambridge, MA, USA

    Shang-Hua Teng

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bose, P. et al. (2000). Online Routing in Convex Subdivisions. In: Goos, G., Hartmanis, J., van Leeuwen, J., Lee, D.T., Teng, SH. (eds) Algorithms and Computation. ISAAC 2000. Lecture Notes in Computer Science, vol 1969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40996-3_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-40996-3_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41255-7

  • Online ISBN: 978-3-540-40996-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation