An optimal solution to a wire-routing problem (preliminary version)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Geometrical compaction in one dimension for channel routing
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Global forced hierarchical router
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
A fast algorithm to test planar topological routability
VLSID '95 Proceedings of the 8th International Conference on VLSI Design
MOLE: a sea-of-gates detailed router
EURO-DAC '90 Proceedings of the conference on European design automation
A provably good algorithm for high performance bus routing
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
A routing algorithm for flip-chip design
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Thick non-crossing paths and minimum-cost flows in polygonal domains
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
IO connection assignment and RDL routing for flip-chip designs
Proceedings of the 2009 Asia and South Pacific Design Automation Conference
RDL pre-assignment routing for flip-chip designs
Proceedings of the 19th ACM Great Lakes symposium on VLSI
The star-routing algorithm based on Manhattan-Diagonal model for three layers channel routing
WSEAS Transactions on Circuits and Systems
Ordered escape routing via routability-driven pin assignment
Proceedings of the 20th symposium on Great lakes symposium on VLSI
Proceedings of the 2010 Asia and South Pacific Design Automation Conference
IO connection assignment and RDL routing for flip-chip designs
ACM Transactions on Design Automation of Electronic Systems (TODAES)
| Hi-index | 0.00 |
A general and practical river routing algorithm is described. It is assumed that there is one layer for routing and terminals are on the boundaries of an arbitrarily shaped rectilinear routing region. All nets are two-terminal nets with pre-assigned (may be different) widths and no crossover between nets is allowed. The minimum separation between the edges of two adjacent wires is input as the design rule. This algorithm assumes no grid on the plane and will always generate a solution if a solution exists. The number of corners is reduced by flipping of corners. An analysis to determine the minimum space required for a strait-type river routing problem is included. Let B be the number of boundary segments and T be the total number of terminals. The time complexity is of O(T(B+T)2) and the storage required is O((B+T)2). This algorithm is implemented as part of the design station under development at the University of California, Berkeley.