Finding a shortest pair of paths on the plane with obstacles and crossing areas
Given axis-parallel rectangular obstacles and crossing areas together with two pairs of terminals on the plane, our algorithm finds a shortest pair of rectilinear paths which connect the pairs of terminals and neither pass through any obstacle nor cross each other except in the crossing areas. The algorithm takes O(n log n) time and O(n) space, where n is the total number of obstacles and crossing areas.
Unable to display preview. Download preview PDF.
- 1.P.J. de Rezend, D.T. Lee, and Y.F. Wu, “Rectilinear shortest paths with rectangular barriers,” Discrete and Computational Geometry, 4, pp. 41–53, 1989.Google Scholar
- 2.J. JáJá, An Introduction to Parallel Algorithms, Addison Wesley, Reading, MA, 1992.Google Scholar
- 3.P.N. Klein,”A linear processor polylog-time algorithm for shortest paths in planar graphs,” Proc. of 34th Symp. on Found. of Comput. Sci., pp. 259–270, 1993.Google Scholar
- 4.D.T.Lee, C.F.Shem, C.D.Yang, and C.K.Wong, “Non-crossing paths problems,” Manuscript, Dept. of EECS, Northwestern Univ., 1991.Google Scholar
- 5.T. Ohtsuki(Editor), Layout Design and Verification, North-Holland, Amsterdam, 1986.Google Scholar
- 6.F.P. Preparata, and M.I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.Google Scholar
- 7.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, pp. 98–107, 1993.Google Scholar
- 8.J. Takahashi, H. Suzuki, and T. Nishizeki, “Shortest non-crossing paths in plane graphs,” Algorithmica, to appear.Google Scholar