A shortest pair of paths on the plane with obstacles and crossing areas

International Journal of Computational Geometry and Applications

Volumn 9, Issue 2, 1999, Pages 151-170

  Kusakari, Yoshiyuki ^a   Suzuki, Hitoshi ^b   Nishizeki, Takao ^a  

^a TOHOKU UNIVERSITY   (Japan)

^b IBARAKI UNIVERSITY   (Japan)

Author keywords

Crossing area; Non crossing path; Plane sweep

Indexed keywords

EID: 0033409992     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S021819599900011X     Document Type: Article

References (16)

1. P. J. de Rezende, D. T. Lee, and Y. F. Wu, "Rectilinear shortest paths with rectangular barriers," Discrete and Computational Geometry, 4, (1989) pp. 41-53.
2. E. G. Gilbert and D. W. Johnson, "Distance functions and their application to robot path planning in the presence of obstacles," IEEE Trans. of Robotics and Automation, RA-1, 1(1985) pp. 21-30.
3. L. Gouzènes, "Strategies for solving collision-free trajectories problems for mobile and manipulator robots," Int. J. of Robotics Research, 3, 4 (1984) pp. 51-65.
4. S. Guha and I. Suzuki, "Proximity problems and the Voronoi diagram on a rectilinear plane with rectangular obstacles," Algorithmica, 17 (1997) pp. 281-307.
5. J. JáJá, An Introduction to Parallel Algorithms, Addison Wesley, Reading, MA, 1992.
6. P. N. Klein, "A linear processor polylog-time algorithm for shortest paths in planar graphs," Proc. of 34th Symp. on Found, of Comput. Sci. (1993) pp. 259-270.
7. Y. Kusakari, H. Suzuki, and T. Nishizeki, "Finding a shortest pair of paths on the plane with obstacles and crossing areas," Proc. of ISAAC'95, Led. Notes in Computer Science, Springer-Verlag, 1004 (1995) pp. 42-51.
8. J-C. Latombe, Robot Motion Planning, (Kluwer Academic Publ.,Boston,1991).
9. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, John Wiley & Sons, Chichester, England, 1990.
10. D. T. Lee, C. F. Shen, C. D. Yang, and C. K. Wong, "Non-crossing paths problems," Manuscript, Dept. of EECS, Northwestern Univ., (1991).
11. T. Lozano-Pérez and M. A. Wesley, "An algorithm for planning collision-free paths among polyhedral obstacles," Communication of the ACM, 22, 10, (1979) pp. 560-570.
12. T. Ohtsuki (Editor), Layout Design and Verification, North-Holland, Amsterdam, 1986.
13. F. P. Preparata, and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
14. J. Takahashi, H. Suzuki, and T. Nishizeki, "Finding shortest non-crossing rectilinear paths in plane regions," Proc. of ISAAC'93, Lect. Notes in Computer Science, Springer-Verlag, 762 (1993) pp. 98-107.
15. J. Takahashi, H. Suzuki, and T. Nishizeki, "Shortest non-crossing paths in plane graphs," Algorithmica 16 (1996) pp. 339-357.
16. J. Takahashi, H. Suzuki, and T. Nishizeki, "Shortest non-crossing rectilinear paths in plane regions," Int. J. of Computational Geometry & Applications, to appear.