Geometric compaction on channel routing
- 1 January 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 11 (1) , 115-127
- https://doi.org/10.1109/43.108624
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Improved channel routing by via minimization and shiftingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Nutcracker: an efficient and intelligent channel spacerPublished by Association for Computing Machinery (ACM) ,1987
- Glitter: A Gridless Variable-Width Channel RouterIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1986
- Two-Dimensional Compaction by 'Zone Refining'Published by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- An Unconstrained Topological Via Minimization Problem for Two-Layer RoutingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1984
- An algorithm for optimal two-dimensional compaction of VLSI layoutsIntegration, 1983
- An Algorithm to Compact a VLSI Symbolic Layout with Mixed ConstraintsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1983
- Improved Compaction by Minimized Length of WiresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- Plane-sweep algorithms for intersecting geometric figuresCommunications of the ACM, 1982
- A “Dogleg” channel routerPublished by Association for Computing Machinery (ACM) ,1976