The problem of distributing the set of crossings between two regions is studied. A crossing is defined as the intersection of two nets. Three types of crossing-distribution problems are considered: (1) the quota problem, (2) the membership problem, and (3) the combination problem, which is a combination of the quota and membership problems. The objective is to find a net ordering at the boundary between two regions such that the quota and membership problems are resolved, and the total number of crossings is minimized. The authors propose the use of computational geometry techniques for the solution of the quota problem in O(n log n) time, the use of a depth-first search to solve the membership in O(n/sup 2/) time, and the use of a breadth-first search to solve the combination problem in O(n/sup 2/) time, where n is the number of tests.<<ETX>>
[1]
Malgorzata Marek-Sadowska,et al.
The crossing distribution problem
,
1991,
1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.
[2]
D. T. Lee,et al.
Computational Geometry—A Survey
,
1984,
IEEE Transactions on Computers.
[3]
Tetsuo Asano,et al.
Routing Region Definition and Ordering Scheme for Building-Block Layout
,
1985,
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[4]
P. Groeneveld,et al.
On Global Wire Ordering for Macro-Cell Routing
,
1989,
26th ACM/IEEE Design Automation Conference.
[5]
Ron Y. Pinter,et al.
Optimal Routing in Rectilinear Channels
,
1981
.