DAC '78 Proceedings of the 15th Design Automation Conference
A solution to line-routing problems on the continuous plane
DAC '69 Proceedings of the 6th annual Design Automation Conference
DAC '77 Proceedings of the 14th Design Automation Conference
Some theoretical aspects of algorithmic routing
DAC '77 Proceedings of the 14th Design Automation Conference
DAC '79 Proceedings of the 16th Design Automation Conference
An application of branch and bound method to automatic printed circuit board routing
DAC '79 Proceedings of the 16th Design Automation Conference
Fast printed circuit board routing
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
A gridless router for industrial design rules
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
A layout improvement method based on constraint propagation for analog LSI's
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
A hardware implementation of gridless routing based on content addressable memory
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Cooperative approach to a practical analog LSI layout system
DAC '93 Proceedings of the 30th international Design Automation Conference
A new routing algorithm and its hardware implementation
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
A large scale cellular array processor: AAP-1
CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
A sequential detailed router for huge grid graphs
Proceedings of the conference on Design, automation and test in Europe
Proceedings of the 39th annual Design Automation Conference
A new two-dimensional routing algorithm
DAC '82 Proceedings of the 19th Design Automation Conference
Automated rip-up and reroute techniques
DAC '82 Proceedings of the 19th Design Automation Conference
Routing of analog busses with parasitic symmetry
Proceedings of the 2005 international symposium on Physical design
Region definition and ordering for macrocells with unconstrained placement
Integration, the VLSI Journal
| Hi-index | 0.00 |
A new routing algorithm is presented which is based on the expansion of a line in the direction perpendicular to the line. The line-expansion principle is first applied to the single layer routing problem. For the routing on two layers only some minor modifications have to be made. An important extension is added in which the search for an interconnection from a given point is initiated in more than one direction at the same time. The major advantage of the line-expansion algorithm over the well-known line-search algorithm is the guarantee that always a solution will be found if one exists.