General River Routing Algorithm
- 1 January 1983
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 0738100X,p. 578-583
- https://doi.org/10.1109/dac.1983.1585712
Abstract
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) /sup 2/) and the storage required is O((B+T) /sup 2/). This algorithm is implemented as part of the design station under development at the University of California, Berkeley.Keywords
This publication has 3 references indexed in Scilit:
- River Routing: Methodology and AnalysisPublished by Springer Nature ,1983
- Optimal Placement for River RoutingPublished by Springer Nature ,1981
- An optimal solution to a wire-routing problem (preliminary version)Published by Association for Computing Machinery (ACM) ,1980