Skip to main content
SpringerLink
Log in

Computing Homotopic Shortest Paths Efficiently

  • Conference paper
  • First Online:
Algorithms — ESA 2002 (ESA 2002)

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

Included in the following conference series:

Abstract

We give algorithms to find shortest paths homotopic to given disjoint paths that wind amongst n point obstacles in the plane. Our deterministic algorithm runs in time O(k log n+n√n), and the randomized version in time O(k log n+n(log n)1+ε) where k is the input plus output sizes of the paths.

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. R. Bar-Yehuda and B. Chazelle. Triangulating disjoint Jordan chains. International Journal of Computational Geometry & Applications, 4(4):475–481, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  2. S. Cabello, Y. Liu, A. Mantler, and J. Snoeyink. Testing homotopy for paths in the plane. In 18th Annual Symposium on Computational Geometry, pages 160–169, 2002.

    Google Scholar 

  3. B. Chazelle. A theorem on polygon cutting with applications. In 23rd Annual Symposium on Foundations of Computer Science, pages 339–349, 1982.

    Google Scholar 

  4. B. Chazelle. An algorithm for segment-dragging and its implementation. Algorithmica, 3:205–221, 1988.

    Article  MathSciNet  Google Scholar 

  5. R. Cole and A. Siegel. River routing every which way, but loose. In 25th Annual Symposium on Foundations of Computer Science, pages 65–73, 1984.

    Google Scholar 

  6. M. deBerg, M. vanKreveld, M. H. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, 2nd edition, 2000.

    Google Scholar 

  7. C. A. Duncan, A. Efrat, S. G. Kobourov, and C. Wenk. Drawing with fat edges. In 9th Symposium on Graph Drawing (GD’01), pages 162–177, September 2001.

    Google Scholar 

  8. H. Edelsbrunner. A note on dynamic range searching. Bulletin of the European Association for Theoretical Computer Science, 15:34–40, Oct. 1981.

    Google Scholar 

  9. A. Efrat, S. Kobourov, and A. Lubiw. Computing homotopic shortest paths efficiently. Technical report, April 2002. http://www.arXiv.org/abs/cs/0204050.

  10. A. Efrat, S. G. Kobourov, M. Stepp, and C. Wenk. Growing fat graphs. In 18th Annual Symposium on Computational Geometry, pages 277–278, 2002.

    Google Scholar 

  11. S. Gao, M. Jerrum, M. Kaufmann, K. Mehlhorn, W. Rülling, and C. Storb. On continuous homotopic one layer routing. In 4th Annual Symposium on Computational Geometry, pages 392–402, 1988.

    Google Scholar 

  12. Hershberger and Snoeyink. Computing minimum length paths of a given homotopy class. CGTA: Computational Geometry: Theory and Applications, 4:63–97, 1994.

    MATH  MathSciNet  Google Scholar 

  13. D. T. Lee and F. P. Preparata. Euclidean shortest paths in the presence of rectilinear barriers. Networks, 14(3):393–410, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  14. C. E. Leiserson and F. M. Maley. Algorithms for routing and testing routability of planar VLSI layouts. In 17th Annual ACM Symposium on Theory of Computing, pages 69–78, 1985.

    Google Scholar 

  15. J. S. B. Mitchell. Geometric shortest paths and network optimization. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry. 1998.

    Google Scholar 

  16. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Univ. of Arizona, USA

    Alon Efrat & Stephen G. Kobourov

  2. School of Computer Science, Univ. of Waterloo, USA

    Anna Lubiw

Authors
  1. Alon Efrat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stephen G. Kobourov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anna Lubiw
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät II: Mathematik und Naturwissenschaften, Technische Universität Berlin, Strasse des 17. Juni 136, 10623, Berlin, Germany

    Rolf Möhring

  2. Department of Mathematics and Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK

    Rajeev Raman

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Efrat, A., Kobourov, S.G., Lubiw, A. (2002). Computing Homotopic Shortest Paths Efficiently. In: Möhring, R., Raman, R. (eds) Algorithms — ESA 2002. ESA 2002. Lecture Notes in Computer Science, vol 2461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45749-6_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-45749-6_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44180-9

  • Online ISBN: 978-3-540-45749-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation