An algorithm for planning collision-free paths among polyhedral obstacles
Communications of the ACM
Introduction to VLSI Systems
Some NP-complete geometric problems
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
25 years of DAC Papers on Twenty-five years of electronic design automation
General river routing algorithm
DAC '83 Proceedings of the 20th Design Automation Conference
Optimal wiring between rectangles
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
An approximation algorithm for manhattan routing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
DAC '82 Proceedings of the 19th Design Automation Conference
The benefits of external wires in single row routing
Information Processing Letters
| Hi-index | 0.00 |
A wire-routing problem which arises commonly in the layout of circuits for very large scale integration (VLSI) is discussed. Given the coordinates of terminals u1, u2, ..., un of one component and v1, v2, ..., vn of another, the problem is to lay out n wires so that the ith wire connects ui to vi, and adjacent wires are separated at least by some fixed distance. The solution with minimum wire length is characterized, and an optimal algorithm which constructs it is presented.