Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
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.
J. JáJá, An Introduction to Parallel Algorithms, Addison Wesley, Reading, MA, 1992.
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.
D.T.Lee, C.F.Shem, C.D.Yang, and C.K.Wong, “Non-crossing paths problems,” Manuscript, Dept. of EECS, Northwestern Univ., 1991.
T. Ohtsuki(Editor), Layout Design and Verification, North-Holland, Amsterdam, 1986.
F.P. Preparata, and M.I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
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.
J. Takahashi, H. Suzuki, and T. Nishizeki, “Shortest non-crossing paths in plane graphs,” Algorithmica, to appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kusakari, Y., Suzuki, H., Nishizeki, T. (1995). Finding a shortest pair of paths on the plane with obstacles and crossing areas. In: Staples, J., Eades, P., Katoh, N., Moffat, A. (eds) Algorithms and Computations. ISAAC 1995. Lecture Notes in Computer Science, vol 1004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015407
Download citation
DOI: https://doi.org/10.1007/BFb0015407
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60573-7
Online ISBN: 978-3-540-47766-2
eBook Packages: Springer Book Archive