An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model

Computational Geometry: Theory and Applications

Volumn 18, Issue 3, 2001, Pages 155-166

  Chen, Danny Z ^a   Xu, Jinhui ^b  

^a University of Notre Dame   (United States)

^b State University of New York   (United States)

Author keywords

Generalized distance tables; Integer data structures; Plane sweeping; Shortest rectilinear paths; Two layer interconnection model; VLSI

Indexed keywords

EID: 0035303811     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(01)00005-0     Document Type: Article

References (23)

1. Chen D.Z., Klenk K.S., Tu H.-Y.T. Shortest path queries among weighted obstacles in the rectilinear plane. SIAM J. Comput. 29:(4):2000;1223-1246.
2. 2n) time. Proc. 3rd Annual ACM Symp. on Computational Geometry. 1987;251-257.
3. 3/2n) time, unpublished manuscript, 1989.
4. de Berg M., van Kreveld M., Nillson B.J., Overmars M.H. Shortest path queries in rectilinear worlds. Internat. J. Comput. Geom. Appl. 3:(2):1992;287-309.
5. Edelsbrunner H., Guibas L.J., Stolfi J. Optimal point location in a monotone subdivision. SIAM J. Comput. 15:(2):1986;317-340.
6. Fredman M.L., Tarjan R.E. Fibonacci heaps and their uses in improved network optimization algorithms. J. of the ACM. 34:(3):1987;596-615.
7. Imai H., Asano T. Dynamic orthogonal segment intersection search. J. Algorithms. 8:1987;1-18.
8. Kirkpatrick D. Optimal search in planar subdivisions. SIAM J. Comput. 12:(1):1983;28-35.
9. Lee D.T., Yang C.D., Chen T.H. Shortest rectilinear paths among weighted obstacles. Internat. J. Comput. Geom. Appl. 1:(2):1991;109-124.
10. Lee D.T., Yang C.D., Wong C.K. Rectilinear paths among rectilinear obstacles. Discrete Appl. Math. 70:1996;185-215.
11. Lee D.T., Yang C.D., Wong C.K. Finding rectilinear paths among obstacles in a two-layer interconnection model. Internat. J. Comput. Geom. Appl. 7:(6):1997;581-598.
12. 1 shortest paths among polygon obstacles in the plane. Algorithmica. 8:(1):1992;55-88.
13. Mitchell J.S.B. Shortest paths among obstacles in the plane. Internat. J. Comput. Geom. Appl. 6:(3):1996;309-332.
14. Mitchell J.S.B. Geometric shortest paths and network optimization. Sack J.-R., Urrutia J. Handbook of Computational Geometry. 1998;Elsevier, Amsterdam.
15. Ohtsuki T. Gridless routers - New wire routing algorithm based on computational geometry. Int. Conf. on Circuits and Systems, China. 1985.
16. Ohtsuki T., Sato M. Gridless routers for two layer interconnection. IEEE Int. Conf. on Computer Aided Design. 1984;76-78.
17. Preparata F.P., Shamos M.I. Computational Geometry: An Introduction. 1985;Springer, New York.
18. van Emde Boas P. Preserving order in a forest in less than logarithmic time and linear space. Inform. Process. Lett. 6:(3):1977;80-82.
19. van Emde Boas P., Kaas R., Zijlstra E. Design and implementation of an efficient priority queue. Math. Syst. Theory. 10:1977;99-127.
20. Wu Y.F., Widmayer P., Schlag M.D.F., Wong C.K. Rectilinear shortest paths and minimum spanning trees in the presence of rectilinear obstacles. IEEE Trans. Comput. 36:1987;321-331.
21. Yang C.D., Lee D.T., Wong C.K. On bends and lengths of rectilinear paths: A graph-theoretic approach. Internat. J. Comput. Geom. Appl. 2:(1):1992;61-74.
22. Yang C.D., Lee D.T., Wong C.K. On bends and distances of paths among obstacles in two-layer interconnection model. IEEE Trans. Comput. 43:(6):1994;711-724.
23. Yang C.D., Lee D.T., Wong C.K. Rectilinear path problems among rectilinear obstacles revisited. SIAM J. Comput. 24:(3):1995;457-472.