Testing Homotopic Routability under Polygonal Wiring Rules

Algorithmica (New York)

Volumn 15, Issue 1, 1996, Pages 1-16

  Maley, F M ^a,b  

^a Princeton University ^*  (United States)

^b Princeton University   (United States)

Author keywords

Disjoint paths; Homotopic routing; River routing; Routability; VLSI layout; Wire routing

Indexed keywords

EID: 0003651513     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01942604     Document Type: Article

References (20)

1. S.-C. Chang, J. JáJá, and K. W. Ryu, Optimal parallel algorithms for one-layer routing, UMIACS Technical Report TR-89-46, University of Maryland, 1989.
2. B. Chazelle and E. Welzl, Quasi-optimal range searching in spaces of finite VC-dimension, Discrete and Computational Geometry, 4 (1989), 467-489.
3. R. Cole and A. Siegel, River routing every which way, but loose, Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984, pp. 65-73.
4. S. Gao, M. Jerrum, M. Kaufmann, K. Mehlhorn, W. Rülling, and C. Storb, On continuous homotopic one layer routing, Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988, pp. 392-402.
5. S. Gao, M. Kaufmann, and F. M. Maley, Advances in homotopic layout compaction, Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989, pp. 273-282.
6. R. I. Greenberg and F. M. Maley, Minimum separation for single-layer channel routing, Information Processing Letters, 43(4) (1992), 201-205.
7. M. Kaufmann and F. M. Maley, Parity conditions in homotopic knock-knee routing, Algorithmica, 9(1) (1993), 47-63.
8. M. Kaufmann and F. M. Maley, Computing congestion during one-dimensional homotopic compaction, Journal of Algorithms, to appear.
9. M. Kaufmann and K. Mehlhorn, On local routing of 2-terminal nets, Journal of Combinatorial Theory Series B, 55(1) (1992), 33-72.
10. C. E. Leiserson and F. M. Maley, Algorithms for routing and testing routability of planar VLSI layouts, Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985, pp. 69-78.
11. F. M. Maley, Toward a mathematical theory of single-layer wire routing, Proceedings of the Fifth MIT Conference on Advanced Research in VLSI, 1988, pp. 277-296.
12. F. M. Maley, Single-Layer Wire Routing and Compaction, MIT Press, Cambridge, MA, 1990.
13. F. M. Maley, A generic algorithm for one-dimensional homotopic compaction, Algorithmica, 6(1) (1991), 103-128.
14. J. Matoušek, Spanning trees with low crossing number, RAIRO: Informatique Theoretique et Applications, 25(2) (1991), 103-123.
15. E. M. McCreight, Priority search trees, SIAM Journal on Computing, 14(2) (1985), 257-276.
16. K. Mehlhorn and S. Näher, A faster compaction algorithm with automatic jog insertion, IEEE Transactions on CAD, 9(2) (1990), 158-166.
17. R. Y. Pinter, The Impact of Layer Assignment Methods on Layout Algorithms for Integrated Circuits, Ph.D. Thesis, EECS Department, MIT, 1982.
18. R. Y. Pinter, River routing: methodology and analysis, Proceedings of the Third Caltech Conference on VLSI, Computer Science Press, Rockville, MD, 1983, pp. 141-163.
19. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
20. N. Sarnak and R. E. Tarjan, Planar point location using persistent search trees, Communications of the ACM, 29(7) (1986), 669-679.