Skip to main content
Springer Nature Link
Log in

Faster Algorithms for Minimum-Link Paths with Restricted Orientations

  • Conference paper
Algorithms and Data Structures (WADS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6844))

Included in the following conference series:

Abstract

We give an O(n 2log2 n)-time algorithm for computing a minimum-link rectilinear path in an n-vertex rectilinear domain in three dimensions; the fastest previously known algorithm of [Wagner, Drysdale and Stein, 2009] has running time O(n 2.5logn). We also present an algorithm to find a minimum-link C-oriented path in a C-oriented domain in the plane; our algorithm is simpler and more time-space efficient than the earlier one of [Adegeest, Overmars and Snoeyink, 1994].

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Adegeest, J., Overmars, M.H., Snoeyink, J.: Minimum-link c-oriented paths: Single-source queries. IJCGA 4(1), 39–51 (1994)

    MathSciNet  MATH  Google Scholar 

  2. Das, G., Narasimhan, G.: Geometric searching and link distance. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol. 519. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  3. de Berg, M.: On rectilinear link distance. CGTA 1, 13–34 (1991)

    MathSciNet  MATH  Google Scholar 

  4. de Berg, M., van Kreveld, M.J., Nilsson, B.J., Overmars, M.H.: Shortest path queries in rectilinear worlds. IJCGA 2(3), 287–309 (1992)

    MathSciNet  MATH  Google Scholar 

  5. Dumitrescu, A., Mitchell, J.S.B., Sharir, M.: Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles. DCG 31(2), 207–227 (2004)

    MathSciNet  MATH  Google Scholar 

  6. Fitch, R., Butler, Z., Rus, D.: 3d rectilinear motion planning with minimum bend paths. In: International Conference on Intelligent Robots and Systems (2001)

    Google Scholar 

  7. Goodman, J.E., O’Rourke, J.: Handbook of disc. and comp. geom. CRC Press series on discrete mathematics and its applications. Chapman & Hall/CRC (2004)

    Google Scholar 

  8. Güting, R.: Conquering Contours: Efficient Algorithms for Computational Geometry. PhD thesis, Fachbereich Informatik. Universität Dortmund (1983)

    Google Scholar 

  9. Güting, R.H., Ottmann, T.: New algorithms for special cases of the hidden line elimination problem. Comp. Vis., Graph., Image Proc. 40(2), 188–204 (1987)

    Article  MATH  Google Scholar 

  10. Hershberger, J., Snoeyink, J.: Computing minimum length paths of a given homotopy class. CGTA 4, 63–97 (1994)

    MathSciNet  MATH  Google Scholar 

  11. Hershberger, J., Suri, S.: BSP for 3d subdivisions. In: SODA 2003 (2003)

    Google Scholar 

  12. Imai, H., Asano, T.: Efficient algorithms for geometric graph search problems. SIAM J. Comput. 15(2), 478–494 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  13. Imai, H., Asano, T.: Dynamic orthogonal segment intersection search. J. Algorithms 8(1), 1–18 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  14. Lee, D.T., Yang, C.D., Wong, C.K.: Rectilinear paths among rectilinear obstacles. Discrete Appl. Math. 70, 185–215 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  15. Lingas, A., Maheshwari, A., Sack, J.-R.: Optimal parallel algorithms for rectilinear link-distance problems. Algorithmica 14(3), 261–289 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  16. Maheshwari, A., Sack, J.-R., Djidjev, D.: Link distance problems. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Comp. Geom., pp. 519–558. Elsevier, Amsterdam (2000)

    Chapter  Google Scholar 

  17. Mikami, K., Tabuchi, K.: A computer program for optimal routing of printed circuit conductors. In: Int. Federation Inf. Proc. Congress, pp. 1475–1478 (1968)

    Google Scholar 

  18. Neyer, G.: Line simplification with restricted orientations. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 13–24. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  19. Ohtsuki, T.: Gridless routers - new wire routing algorithm based on computational geometry. In: Internat. Conf. on Circuits and Systems, China (1985)

    Google Scholar 

  20. Paterson, M., Yao, F.F.: Optimal binary space partitions for orthogonal objects. J. Algorithms 13(1), 99–113 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  21. Rawlins, G.J.E., Wood, D.: Optimal computation of finitely oriented convex hulls. Inf. Comput. 72(2), 150–166 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  22. Sato, M., Sakanaka, J., Ohtsuki, T.: A fast line-search method based on a tile plane. In: Proc. IEE ISCAS, pp. 588–591 (1987)

    Google Scholar 

  23. Wagner, D.P., Drysdale, R.L.S., Stein, C.: An O(n 2.5logn) algorithm for the rectilinear minimum link-distance problem in three dimensions. CGTA 42(5), 376–387 (2009)

    MATH  Google Scholar 

  24. Widmayer, P., Wu, Y.-F., Wong, C.K.: On some distance problems in fixed orientations. SIAM J. Comput. 16(4), 728–746 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  25. Yang, C.D., Lee, D.T., Wong, C.K.: On bends and lengths of rectilinear paths: a graph theoretic approach. IJCGA 2(1), 61–74 (1992)

    MathSciNet  MATH  Google Scholar 

  26. Yang, C.D., Lee, D.T., Wong, C.K.: On bends and distances of paths among obstacles in 2-layer interconnection model. IEEE Tran. Comp. 43(6), 711–724 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  27. Yang, C.D., Lee, D.T., Wong, C.K.: Rectilinear paths problems among rectilinear obstacles revisited. SIAM J. Comput. 24, 457–472 (1995)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Helsinki Institute for Information Technology, Department of Computer Science, University of Helsinki, Finland

    Valentin Polishchuk & Mikko Sysikaski

Authors
  1. Valentin Polishchuk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mikko Sysikaski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Parallel Computing and Bioinformatics Laboratory, Carleton University, VISM Building, Room 6210, 1125 Colonel By Drive, K1S 5B6, Ottawa, ON, Canada

    Frank Dehne

  2. Department of Computer Science and Engineering, Polytechnic Institute of New York University, 5 MetroTech Center, 11201, New York, NY, USA

    John Iacono

  3. School of Computer Science, Herzberg Laboratories, Carleton University, Herzberg Building, Room 5350, 1125 Colonel By Drive, K1S 5B6, Ottawa, ON, Canada

    Jörg-Rüdiger Sack

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Polishchuk, V., Sysikaski, M. (2011). Faster Algorithms for Minimum-Link Paths with Restricted Orientations. In: Dehne, F., Iacono, J., Sack, JR. (eds) Algorithms and Data Structures. WADS 2011. Lecture Notes in Computer Science, vol 6844. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22300-6_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22300-6_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22299-3

  • Online ISBN: 978-3-642-22300-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics