Title :
A Linear-Time Routing Algorithm for Convex Grids
Author :
Nishizeki, Takao ; Saito, Nobuji ; Suzuki, Kiminobu
Author_Institution :
Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan
fDate :
1/1/1985 12:00:00 AM
Abstract :
In this paper, we consider the channel routing problem involving two-terminal nets on rectilinear grids. An efficient algorithm is described which necessarily finds a routing in a given grid whenever it exists. The algorithm is not a heuristic but an exact one, and works for a rather large class of grids, called convex grids, including the grids of rectangular, T-, L-, or X-shape boundaries. Both the running time and required space are linear in the number of vertices of a grid.
Keywords :
Circuits; Heuristic algorithms; Joining processes; Partitioning algorithms; Routing; Shape; Turning; Very large scale integration; Wiring;
Journal_Title :
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
DOI :
10.1109/TCAD.1985.1270099
