Advertisement

Efficient Algorithms for Geometric Shortest Path Query Problems

  • Danny Z. Chen
Chapter

Abstract

Computing shortest paths in a geometric environment is a fundamental topic in computational geometry and finds applications in many other areas. The problem of processing geometric shortest path queries is concerned with constructing an efficient data structure for quickly answering on-line queries for shortest paths connecting any two query points in a geometric setting. This problem is a generalization of the well-studied problem of computing a geometric shortest path connecting only two specified points. This paper covers the newly-developed algorithmic paradigms for processing geometric shortest path queries and related problems. These general paradigms have led to efficient techniques for designing algorithms and data structures for processing a variety of queries on exact and approximate shortest paths in a number of geometric and graphical settings. Some open problems and promising directions for future research are also discussed.

Keywords

Short Path Planar Graph Query Point Steiner Point Path Query 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    P.K. Agarwal, Ray shooting and other applications of spanning trees with low stabbing number, SIAM J. Computing Vol.21 No.3 (1992) pp. 540–570.CrossRefzbMATHGoogle Scholar
  2. [2]
    P.K. Agarwal and J. Matousek, Ray shooting and parametric search, SIAM J. Computing Vol.22 No.4 (1993) pp. 794–806.CrossRefzbMATHMathSciNetGoogle Scholar
  3. [3]
    P.K. Agarwal and M. Sharir, Applications of a new space partitioning technique, Proc. of 2nd Workshop on Algorithms and Data Structures, 1991, pp. 379–391.Google Scholar
  4. [4]
    A. Aggarwal, M.M. Klawe, S. Moran, P. Shor, and R. Wilber, Geometric applications of a matrix searching algorithm, Algorithmica Vol.2 (1987) pp. 209–233.CrossRefMathSciNetGoogle Scholar
  5. [5]
    A. Aggarwal and J. Park, Parallel searching in multidimensional monotone arrays, Proc. of 29th Annual IEEE Symp. Foundations of Computer Science, 1988, pp. 497–512.Google Scholar
  6. [6]
    O. Aichholzer, F. Aurenhammer, D.Z. Chen, D.T. Lee, A. Mukhopadhyay, and E. Papadopoulou, Voronoi diagrams for direction-sensitive distances, Proc. of 13th Annual ACM Symp. Computational Geometry, Nice, France, 1997, pp. 418–420.Google Scholar
  7. [7]
    A. Apostolico, M.J. Atallah, L. Larmore, and H.S. McFaddin, Efficient parallel algorithms for string editing and related problems, SIAM J. on Computing Vol.19 (1990), pp. 968–988.CrossRefzbMATHMathSciNetGoogle Scholar
  8. [8]
    S. Arikati, D.Z. Chen, L.P. Chew, G. Das, M. Smid, and C.D. Zaroliagis, Planar spanners and approximate shortest path queries among obstacles in the plane, Proc. of 4th Annual European Symposium on Algorithms, Barcelona, Spain, 1996, pp. 514–528.Google Scholar
  9. [9]
    E.M. Arkin, R. Connelly, and J.S.B. Mitchell, On monotone paths among obstacles, with applications to planning assemblies, Proc. of 5th Annual ACM Symp. Computational Geometry, 1989, pp. 334–343.Google Scholar
  10. [10]
    E.M. Arkin, J.S.B. Mitchell, and S. Suri, Optimal link path queries in a simple polygon, Proc. of 3rd Annual ACM-SIAM Symp. Discrete Algorithms, 1992, pp. 269–279.Google Scholar
  11. [11]
    S. Arya, G. Das, D.M. Mount, J.S. Salowe, and M. Smid, Euclidean spanners: Short, thin, and lanky, Proc. of 27th Annual ACM Symp. Theory of Computing, 1995, pp. 489–498.Google Scholar
  12. [12]
    S. Arya, D.M. Mount, N.S. Netanyahu, R. Silverman, and A. Wu, An optimal algorithm for approximate nearest neighbor searching, Proc. of 5th ACM-SIAM Symp. Discrete Algorithms, 1994, pp. 573–582.Google Scholar
  13. [13]
    M.J. Atallah and D.Z. Chen, Parallel rectilinear shortest paths with rectangular obstacles, Computational Geometry: Theory and Applications Vol.1 No.2 (1991) pp. 79–113.CrossRefzbMATHMathSciNetGoogle Scholar
  14. [14]
    M.J. Atallah and D.Z. Chen, On parallel rectilinear obstacle-avoiding paths, Computational Geometry: Theory and Applications Vol.3 No.6 (1993) pp. 307–313.CrossRefzbMATHMathSciNetGoogle Scholar
  15. [15]
    M.J. Atallah and D.Z. Chen, Computing the all-pairs longest chains in the plane, International Journal of Computational Geometry Applications Vol.5 No.3 (1995) pp. 257–271.CrossRefzbMATHMathSciNetGoogle Scholar
  16. [16]
    M.J. Atallah and D.Z. Chen, Applications of a numbering scheme for polygonal obstacles in the plane, Proc. of 7th Annual International Symp. Algorithms and Computation, Osaka, Japan, 1996, pp. 1–24.Google Scholar
  17. [17]
    M.J. Atallah, D.Z. Chen, and O. Daescu, Efficient parallel algorithms for planar st-graphs, Proc. of 8th Annual International Symp. Algorithms and Computation, Singapore, 1997, pp. 223–232.Google Scholar
  18. [18]
    M.J. Atallah, D.Z. Chen, and K.S. Klenk, Parallel algorithms for longest increasing chains in the plane and related problems, Proc. of 9th Canadian Conference Computational Geometry, Kingston, Canada, 1997, pp. 59–64.Google Scholar
  19. [19]
    M. Ben-Or, Lower bounds for algebraic computation trees. Proc. of 15th Annual ACM Symp. Theory of Computing, 1983, pp. 80–86.Google Scholar
  20. [20]
    J. Canny and J.H. Reif, New lower bound techniques for robot motion planning problems, Proc. of 28th IEEE Annual Symp. Foundations of Computer Science, 1987, pp. 49–60.Google Scholar
  21. [21]
    B. Chazelle and L.J. Guibas, Fractional cascading: I. A data structuring technique, Algorithmica Vol.1 No.2 (1986) pp. 133–162.CrossRefzbMATHMathSciNetGoogle Scholar
  22. [22]
    B. Chazelle and L.J. Guibas, Fractional cascading: II. Applications, Algorithmica Vol.1 No.2 (1986) pp. 163–191.CrossRefzbMATHMathSciNetGoogle Scholar
  23. [23]
    D.Z. Chen, On the all-pairs Euclidean short path problem, Proc. of 6th Annual ACM-SIAM Symp. Discrete Algorithms, San Francisco, 1995, pp. 292–301.Google Scholar
  24. [24]
    D.Z. Chen, Developing algorithms and software for geometric path planning problems, ACM Computing Surveys Vol.28 No.4es (1996) Article 18, http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a18chen/ CrossRefGoogle Scholar
  25. [25]
    D.Z. Chen, O. Daescu, and K.S. Klenk, On geometric path query problems, Proc. of Fifth International Workshop on Algorithms and Data Structures, Halifax, Canada, 1997, pp. 248–257.Google Scholar
  26. [26]
    D.Z. Chen, G. Das and M. Smid, Lower bounds for computing geometric spanners and approximate shortest paths, Proc. of 8th Canadian Conference on Computational Geometry, Ottawa, Canada, 1996, pp. 155–160.Google Scholar
  27. [27]
    D.Z. Chen and X. Hu, Efficient approximation algorithms for floorplan area minimization, Proc. of 33rd ACM/IEEE Design Automation Conference, Las Vegas, 1996, pp. 483–486.Google Scholar
  28. [28]
    D.Z. Chen and K.S. Klenk, Rectilinear short path queries among rectangular obstacles, Information Processing Letters Vol.57 No.6 (1996) pp. 313–319.CrossRefzbMATHGoogle Scholar
  29. [29]
    D.Z. Chen, K.S. Klenk, and H.-Y.T. Tu, Shortest path queries among weighted obstacles in the rectilinear plane, Proc. of 11th Annual ACM Symp. Computational Geometry, Vancouver, Canada, 1995, pp. 370–379.Google Scholar
  30. [30]
    D.Z. Chen, K.S. Klenk, and H.-Y.T. Tu, Shortest path queries among weighted obstacles in the rectilinear plane, submitted, 1996.Google Scholar
  31. [31]
    L.P. Chew, Planar graphs and sparse graphs for efficient motion planning in the plane, Computer Science Tech. Report, PCS-TR90–146, Dartmouth College, 1987.Google Scholar
  32. [32]
    L.P. Chew, Constrained Delaunay triangulations, Algorithmica Vol.4 (1989) pp. 97–108.CrossRefzbMATHMathSciNetGoogle Scholar
  33. [33]
    L.P. Chew, There are planar graphs almost as good as the complete graph, J. of Computer and System Sciences Vol.39 (1989) pp. 205–219.CrossRefzbMATHMathSciNetGoogle Scholar
  34. [34]
    L.P. Chew and R.L. Drysdale, Voronoi diagrams based on convex distance functions, Proc. of 1st Annual ACM Symp. Computational Geometry, 1985, pp. 235–244.Google Scholar
  35. [35]
    Y.-J. Chiang, F.P. Preparata, and R. Tamassia, A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps, Proc. of.nth Annual ACM-SIAM Symp. Discrete Algorithms,1993, pp. 44–53.Google Scholar
  36. [36]
    J. Choi, J. Sellen, and C.-K. Yap, Approximate Euclidean shortest path in 3-space, Proc. of 10th Annual ACM Symp. Computational Geometry, 1994, pp. 41–48.Google Scholar
  37. [37]
    K.L. Clarkson, Approximation algorithms for shortest path motion planning, Proc. of 19th Annual ACM Symp. Theory of Computing, 1987, pp. 56–65.Google Scholar
  38. [38]
    K.L. Clarkson, S. Kapoor, and P.M. Vaidya, Rectilinear shortest paths through polygonal obstacles in O(n(logn)2) time, Proc. of 3rd Annual ACM Symp. Computational Geometry, 1987, pp. 251–257.Google Scholar
  39. [39]
    K.L. Clarkson, S. Kapoor, and P.M. Vaidya, Rectilinear shortest paths through polygonal obstacles in O(n log3/2 n) time, manuscript.Google Scholar
  40. [40]
    T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, (McGraw-Hill Book Company, New York, 1990).zbMATHGoogle Scholar
  41. [41]
    M. de Berg, On rectilinear link distance, Computational Geometry: Theory and Applications Vol.1 (1991) pp. 13–34.CrossRefzbMATHMathSciNetGoogle Scholar
  42. [42]
    M. de Berg, M. van Kreveld, M. Overmars, and O. Schwartzkopf, Computational Geometry: Algorithms and Applications, (Springer-Verlag, 1997).zbMATHGoogle Scholar
  43. [43]
    W. Dobosiewicz, A more efficient algorithm for the min-plus multiplication, International Journal of Computer Mathematics Vol.32 No.1 (1990) pp. 4960.CrossRefGoogle Scholar
  44. [44]
    H. Edelsbrunner, Algorithms in Combinatorial Geometry, (Springer-Verlag, Heidelberg, Germany, 1987).zbMATHGoogle Scholar
  45. [45]
    H. ElGindy and P. Mitra, Orthogonal shortest route queries among axes parallel rectangular obstacles, International J. of Computational Geometry e.4 Applications Vol.4 No.1 (1994) pp. 3–24.CrossRefzbMATHMathSciNetGoogle Scholar
  46. [46]
    G.N. Frederickson, Fast algorithms for shortest paths in planar graphs, with applications, SIAM J. on Computing Vol.16 (1987) pp. 1004–1022.CrossRefzbMATHGoogle Scholar
  47. [47]
    G.N. Frederickson, Planar graph decomposition and all pairs shortest paths, J. of the ACM Vol.38 No.1 (1991) pp. 162–204.CrossRefzbMATHMathSciNetGoogle Scholar
  48. [48]
    M.L. Fredman and R.E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM Vol.34 No.3 (1987) pp. 596–615.CrossRefMathSciNetGoogle Scholar
  49. [49]
    M.T. Goodrich and R. Tamassia, Dynamic ray shooting and shortest paths via balanced geodesic triangulations, Proc. of 9th Annual ACM Symp. Computational Geometry, 1993, pp. 318–327.Google Scholar
  50. [50]
    S. Guha and I. Suzuki, Proximity problems for points on a rectilinear plane with rectangular obstacles, Algorithmica Vol.17 (1997) pp. 281–307.CrossRefzbMATHMathSciNetGoogle Scholar
  51. [51]
    L.J. Guibas and J. Hershberger, Optimal shortest path queries in a simple polygon, J. of Computer and System Sciences Vol.39 (1989) pp. 126–152.CrossRefzbMATHMathSciNetGoogle Scholar
  52. [52]
    D. Harel and R.E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Computing Vol.13 (1984) pp. 338–355.CrossRefzbMATHMathSciNetGoogle Scholar
  53. [53]
    J. Hershberger, A new data structure for shortest path queries in a simple polygon, Information Processing Letters Vol.38 (1991) pp. 231–235.CrossRefzbMATHMathSciNetGoogle Scholar
  54. [54]
    J. Hershberger and S. Suri, Efficient computation of Euclidean shortest paths in the plane, SIAM J. on Computing (1998).Google Scholar
  55. [55]
    M. Iwai, H. Suzuki, and T. Nishizeki, Shortest path algorithm in the plane with rectilinear polygonal obstacles (in Japanese), Proc. of SIGAL Workshop, Ryukoku University, Japan, 1994.Google Scholar
  56. [56]
    P.N. Klein, S. Rao, M. Rauch, and S. Subramanian, Faster shortest-path algorithms for planar graphs, Proc. of 26th Annual ACM Symp. Theory of Computing, 1994, pp. 27–37.Google Scholar
  57. [57]
    D.T. Lee, C.D. Yang, and T.H. Chen, Shortest rectilinear paths among weighted obstacles, International J. of Computational Geometry & Applications, Vol.1 No.2 (1991) pp. 109–124.CrossRefzbMATHMathSciNetGoogle Scholar
  58. [58]
    D.T. Lee, C.D. Yang, and C.K. Wong, Rectilinear paths among rectilinear obstacles, Discrete Applied Mathematics Vol.70 (1996) pp. 185–215.CrossRefzbMATHMathSciNetGoogle Scholar
  59. [59]
    R.J. Lipton and R.E. Tarjan, A separator theorem for planar graphs, SIAM J. Applied Mathematics Vol.36 (1979) pp. 177–189.CrossRefzbMATHMathSciNetGoogle Scholar
  60. [60]
    K. Mehlhorn, A faster approximation algorithm for the Steiner problem in graphs, Information Processing Letters Vol.27 (1988) pp. 125–128.CrossRefzbMATHMathSciNetGoogle Scholar
  61. [61]
    J.S.B. Mitchell, An optimal algorithm for shortest rectilinear paths among obstacles, Proc. of 1st Canadian Conf. Computational Geometry,Montreal, Canada, 1989.Google Scholar
  62. [62]
    J.S.B. Mitchell, L1 shortest paths among polygonal obstacles in the plane, Algorithmica Vol.8 (1992) pp. 55–88.CrossRefzbMATHMathSciNetGoogle Scholar
  63. [63]
    J.S.B. Mitchell, Shortest paths and networks, in J.E. Goodman and J. O’Rourke (eds.) Handbook of Discrete and Computational Geometry, (CRC Press LLC, 1997), pp. 445–466.Google Scholar
  64. [64]
    J.S.B. Mitchell, Geometric shortest paths and network optimization, in J.-R. Sack and J. Urrutia (eds.) Handbook of Computational Geometry, (Elsevier Science, Amsterdam, 1998).Google Scholar
  65. [65]
    J.S.B. Mitchell, G. Rote, and G. Woeginger, Minimum-link paths among obstacles in the plane, Algorithmica Vol.8 (1992) pp. 431–459.CrossRefzbMATHMathSciNetGoogle Scholar
  66. [66]
    J.S.B. Mitchell and S. Suri, Geometric algorithms, in M.O. Ball, T.L. Mag-nanti, C.L. Monma, and G.L. Nemhauser (eds.) Network Models, Handbook of Operations Research/Management Science, (Elsevier Science, Amsterdam, 1995), pp. 425–479Google Scholar
  67. [67]
    P. Mitra and B. Bhattacharya, Efficient approximation shortest-path queries among isothetic rectangular obstacles, Proc. of 3rd Workshop on Algorithms and Data Structures, 1993, pp. 518–529.Google Scholar
  68. [68]
    K. Mulmuley, Computational Geometry: An Introduction through Randomized Algorithms, (Prentice Hall, New York, 1993).zbMATHGoogle Scholar
  69. [69]
    C.H. Papadimitriou, An algorithm for shortest-path motion in three dimensions, Information Processing Letters Vol.22 (1985) pp. 259–263.CrossRefMathSciNetGoogle Scholar
  70. [70]
    M. Pocchiola and G. Vegter, Computing the visibility graph via pseudo-triangulations, Proc. of 11th Annual ACM Symp. Computational Geometry,1995, pp. 248–257.Google Scholar
  71. [71]
    M. Pocchiola and G. Vegter, The visibility complex, Internatational J. of Computational Geometry & Applications Vol.6 No.3 (1996) pp. 279–308.CrossRefzbMATHMathSciNetGoogle Scholar
  72. [72]
    F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction, (Springer-Verlag, Berlin, 1985).Google Scholar
  73. [73]
    B. Schieber and U. Vishkin, On finding lowest common ancestors: Simplification and parallelization, SIAM J. Computing Vol.17 (1988) pp. 1253–1262.CrossRefzbMATHMathSciNetGoogle Scholar
  74. [74]
    S. Schuierer, An optimal data structure for shortest rectilinear path queries in a simple rectilinear polygon, International J. of Computational Geometry 66 Applications Vol.6 No.2 (1996) pp. 205–225.CrossRefzbMATHMathSciNetGoogle Scholar
  75. [75]
    P. Widmayer, Y.F. Wu, and C.K. Wong, On some distance problems in fixed orientations, SIAM J. on Computing Vol.16 No.4 (1987) pp. 728–746.CrossRefzbMATHMathSciNetGoogle Scholar
  76. [76]
    C.D. Yang, D.T. Lee, and C.K. Wong, Rectilinear path problems among rectilinear obstacles revisited, SIAM J. Computing Vol.24 No.3 (1995) pp. 457–472.CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Kluwer Academic Publishers 1998

Authors and Affiliations

  • Danny Z. Chen
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of Notre DameNotre DameUSA

Personalised recommendations