Rectilinear short path queries among rectangular obstacles

Information Processing Letters

Volumn 57, Issue 6, 1996, Pages 313-319

  Chen, Danny Z ^a   Klenk, Kevin S ^a  

^a University of Notre Dame   (United States)

Author keywords

Algorithms; Analysis of algorithms; Computational geometry; Data structures; Design of algorithms; Shortest path

Indexed keywords

EID: 0042040340     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00020-8     Document Type: Article

References (27)

1. M.J. Atallah and D.Z. Chen, Parallel rectilinear shortest paths with rectangular obstacles, in: Computational Geometry: Theory and Applications, Vol. 1 (Elsevier, Amsterdam, 1991) 79-113.
2. M.J. Atallah and D.Z. Chen, On parallel rectilinear obstacle-avoiding paths, in: Computational Geometry: Theory and Applications, Vol. 3 (Elsevier, Amsterdam, 1993) 307-313.
3. O. Berkman and U. Vishkin, Finding level-ancestors in trees. Tech. Rept. UMIACS-TR-91-9, University of Maryland, 1991.
4. D.Z. Chen, On the all-pairs Euclidean short path problem, in: Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms, San Francisco (1995) 292-301.
5. D.Z. Chen, K.S. Klenk and H.-Y.T. Tu, Shortest path queries among weighted obstacles in the rectilinear plane, in: Proc. 11h Ann. Symp. on Computational Geometry, Vancouver, BC, Canada (1995) 370-379.
6. J. Choi and C.-K. Yap, Rectilinear geodesies in 3-space, in: Proc. 11th Ann. Symp. on Computational Geometry, Vancouver, BC, Canada (1995) 380-389.
7. K.L. Clarkson, Approximation algorithms for shortest path motion planning, in: Proc. 19th Ann. Symp. on the Theory of Computing (1987) 56-65.
8. 3/2 n) time.
9. 2) time, in: Proc. 3rd Ann. Symp. on Computational Geometry, Waterloo, Ontario, Canada (1987) 251-257.
10. M. de Berg, M. van Kreveld and B.J. Nilsson, Shortest path queries in rectangular worlds of higher dimension, in: Proc. 7th Ann. Symp. on Computational Geometry, North Conway, NH (1991) 51-59.
11. P.J. de Rezende, D.T. Lee and Y.F. Wu, Rectilinear shortest paths in the presence of rectangular barriers, Discrete Comput. Geom. 4 (1989) 41-53.
12. H. Edelsbrunner, L.J. Guibas and J. Stolfi, Optimal point location in a monotone subdivision, SIAM J. Comput. 15 (1986) 317-340.
13. H. ElGindy and P. Mitra, Orthogonal shortest route queries among axes parallel rectangular obstacles, Internat. J. Comput. Geom. Appl. 4 (1994) 3-24.
14. D. Harel and R.E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comput. 13 (1984) 338-355.
15. M. Iwai, H. Suzuki and T. Nishizeki, Shortest path algorithm in the plane with rectilinear polygonal obstacles, in: Proc. SIGAL Workshop, Ryukoku University, Japan (1994), in Japanese.
16. D. Kirkpatrick, Optimal search in planar subdivisions, SIAM J. Comput. 12 (1983) 28-35.
17. R.C. Larson and V.O.K. Li, Finding minimum rectilinear distance paths in the presence of barriers, Networks 11 (1981) 285-304.
18. D.T. Lee, C.D. Yang and T.H. Chen, Shortest rectilinear paths among weighted obstacles, Internat. J. Comput. Geom. Appl. 1 (1991) 109-124.
19. R.J. Lipton and R.E. Tarjan, Applications of a planar separator theorem, in: Proc. 18th Ann. Symp. on the Foundations of Computer Science, Providence, RI (1977) 162-170.
20. R.J. Lipton and R.E. Tarjan, A separator theorem for planar graphs, in: Proc. Conf. on Theoretical Computer Science, Waterloo, Ontario (1977) 1-10.
21. R.J. Lipton and R.E. Tarjan, Applications of a planar separator theorem, SIAM J. Comput. 9 (1980) 615-627.
22. J.S.B. Mitchell, An optimal algorithm for shortest rectilinear paths among obstacles, Presented at the 1st Canadian Conf. on Computational Geometry, Montreal, Canada (1989).
23. 1 shortest paths among polygonal obstacles in the plane, Algorithmica 8 (1992) 55-88.
24. P. Mitra and B. Bhattacharya, Efficient approximate shortest-path queries among isothetic rectangular obstacles, in: F. Dehne, J.-R. Sack, N. Santoro and S. Whitesides, eds., Proc. 3rd Workshop Algorithms and Data Structures, Montréal, Canada, 1993, Lecture Notes in Computer Science 709 (Springer, Berlin) 518-529
25. B. Schieber and U. Vishkin, On finding lowest common ancestors: Simplification and parallelization, SIAM J. Comput. 17 (1988) 1253-1262.
26. Y.-F. Wu, P. Widmayer, M.D.F. Schlag and C.K. Wong, Rectilinear shortest paths and minimum spanning trees in the presence of rectilinear obstacles, IEEE Trans. Comput. (1987) 321-331.
27. C.D. Yang, T.H. Chen and D.T. Lee, Shortest rectilinear paths among weighted rectangles, J. Inform. Process. 13 (1990) 456-462.