This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Bends and Distances of Paths Among Obstacles in Two-Layer Interconnection Model
June 1994 (vol. 43 no. 6)
pp. 711-724

We consider problems of finding assorted rectilinear paths among rectilinear obstacles in a two-layer interconnection model according to the number of bends and the 1-layer distance (y-distance). Using a horizontal wave-front approach, optimal /spl theta/(e log e) time algorithms are presented to find the shortest path and the minimum-bend path using linear space, and to find the shortest minimum-bend path and the minimum-bend shortest path using O(e log e) space, where e is the number of obstacle edges. By the same approach, we also derive an algorithm for finding a shortest two-layer distance (xy-distance) minimum-bend path in optimal /spl theta/(e log e) time using O(e log e) space.

[1] T. Asano, T. Asano, L. Guibas, J. Hershberger, and H. Imai, "Visibility of disjoint polygons,"Algorithmica, vol. 1, 1986, pp. 49-63.
[2] B. Chazelle, "An algorithm for segment dragging and its implementation,"Algorithmica, vol. 3, 1988, pp. 205-221.
[3] K. L. Clarkson, S. Kapoor, and P. M. Vaidya, "Rectilinear shortest paths through polygonal obstacles inO(nlog3/2n) time," unpublished manuscript, 1988.
[4] J. P. Cohoon and D. S. Richards, "Optimal two-terminalα-βrouting,"INTEGRATION: The VLSI J., vol. 6, pp. 35-57, 1988.
[5] G. Das and G. Narasimhan, "Geometric Searching and Link distance," inProc. WADS'91, Lect. Notes in Computer Science, vol. 519. New York: Springer-Verlag, 1991, pp. 261-272.
[6] M. de Berg, M. van Kreveld, B. J. Nilsson, aud M. H. Overmars, "Finding shortest paths in the presence of orthogonal obstacles using a combinedL1and Link metrics," inProc. 2nd SWAT 1990, Lect. Notes in Computer Science, vol. 447. New York: Springer-Verlag, 1990, pp. 213-223.
[7] P. J. deRezende, D. T. Lee, and Y. F. Wu, "Rectilinear shortest paths with rectangular barriers,"Discrete and Computational Geometry, vol. 4, pp. 41-53, 1989.
[8] H. N. Djidjev, A. Lingas, and J. Sack, "AnO(nlogn) time: algorithm for computing the link center in a simple polygon," inProc. STACS'89, Lect. Notes in Computer Science, vol. 349, B. Monien and R. Cori, Eds. New York: Springer Verlag, 1989, pp. 96-107.
[9] L. J. Guibas and J. Hershberger, "Optimal shortest path queries in a simple polygon," inProc. 3rd ACM Symp. on Computational Geometry, 1987, pp. 50-63.
[10] T. C. Hu and M. T. Shing, "Theα-βrouting," inVLSI Circuit Layout: Theory and Design, T. C. Hu and E. S. Kuh, Eds. New York: IEEE Press, 1985, pp. 139-143.
[11] H. Imai and T. Asano, "Dynamic segment intersection search with applications," inProc. 25th IEEE Symp. on Foundations of Comput.- Sci., Singer Island, FL, 1984, pp. 393-402.
[12] Y. Ke, "An efficient algorithm for link distance problems," inProc. 5th ACM symp. on Computational Geometry, 1989, pp. 69-78.
[13] R. C. Larson and V. O. Li, "Finding minimum rectilinear distance paths in the presence of barriers,"Networks, vol. 11, pp. 285-304, 1981.
[14] D. T. Lee, "Proximity and reachability in the plane," Ph.D. Dissertation, Univ. of Illinois, 1978.
[15] D. T. Lee and F. P. Preparata, "Euclidean shortest paths in the presence of rectilinear barriers,"Networks, vol. 14, pp. 393-410, 1984.
[16] D. T. Lee, C. D. Yang, and T. H. Chen, "Shortest rectilinear paths among weighted obstacles,"Int. J. Computational Geometry&Applicat., vol. 1, no. 2, 1991, pp. 109-124.
[17] W. Lenhart, R. Pollack, J. Sack, R. Seidel, M. Sharir, S. Ruri, G. Toussaint, S. Whitesides, and C. Yap, "Computing the link center of a simple polygon,"Discrete Computat. Geometry, vol. 3, pp. 281-293, 1988.
[18] T. Lozano-Perez and M.A. Wesley, "An Algorithm for Planning Collision-Free Paths Among Polyhedral Obstacles,"Comm. ACM, Vol. 22, No. 10, 1979, pp. 560-570.
[19] J. S. B. Mitchell and C. Papadimitriou, "Planning shortest paths," presented atSIAM Conf.July 15-19, 1985.
[20] J. S. B. Mitchell, "Shortest rectilinear paths among obstacles,"Algorithmica, vol. 8, 1992, 55-88.
[21] J. S. B. Mitchell, "A new algorithm for shortest paths among obstacles in the plane," Tech. Rep. No. 832, School of OR/IE, Cornell Univ., Oct. 1988.
[22] J. S. B. Mitchell, "Shortest paths among obstacles in the plane," inProc. Ninth ACM Annu. Symp. Computat. Geometry, San Diego, CA, May 1993, pp. 308-317.
[23] J. S. B. Mitchell, G. Rote, and G. Woginger, "Computing the minimum link path among a set of obstacles in the place," inProc. 6th ACM Symp. Computat. Geometry, 1990, pp. 301-310.
[24] T. Ohtsuki and M. Sato, "Gridless routers for two layer interconnection," inIEEE int. Conf. Comput. Aided Design, Nov. 1984, pp. 76-78.
[25] T. Ohtsuki, "Gridless routers--New wire routing algorithm based on computational geometry," presented at theInt. Conf. Circuits and Syst., China, 1985.
[26] F. P. Preparata and M. I. Shamos,Computational Geometry, an Introduction. New York: Springer-Verlag, 1985.
[27] S. Suri, "Minimum link paths in polygons and related problems," Ph.D. thesis, John Hopkins Univ., 1986.
[28] E. Welzl, "Constructing the visibility graph fornline segments inO(n2) time,"Inform. Processing Lett., pp. 167-171, 1985.
[29] P. Widmayer, "Network design issues in VLSI," manuscript, 1989.
[30] 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., vol. 36, pp. 321-331, 1987.
[31] C. D. Yang, T. H. Chen, and D. T. Lee, "Shortest rectilinear paths among weighted rectangles,"J. Inform. Processing, vol. 13, no. 4, 456-462, 1990.
[32] C. D. Yang, D. T. Lee, and C. K. Wong, "On bends and lengths of rectilinear paths: A graphtheoretic approach,"Int. J. Computat. Geometry&Applicat., vol. 2, no. 1, 61-74, Mar. 1992.
[33] C. D. Yang, D. T. Lee, and C. K. Wong, "Rectilinear path problems among rectilinear obstacles revisited,"SIAM J. Computing, to appear.

Index Terms:
multiprocessor interconnection networks; computational geometry; computational complexity; network synthesis; minimisation of switching nets; bends; distances; paths; obstacles; two-layer interconnection model; rectilinear paths; horizontal wave-front approach; optimal time algorithms; shortest path; minimum-bend path; linear space; VLSI; 2-terminal wire routing; computational geometry.
Citation:
D.T. Lee, C.D. Yang, C.K. Wong, "On Bends and Distances of Paths Among Obstacles in Two-Layer Interconnection Model," IEEE Transactions on Computers, vol. 43, no. 6, pp. 711-724, June 1994, doi:10.1109/12.286304
Usage of this product signifies your acceptance of the Terms of Use.