A new algorithm for floorplan design
DF Wong, CL Liu - 23rd ACM/IEEE Design Automation …, 1986 - ieeexplore.ieee.org
We present in this paper a new algorithm for floorplan design using the method of simulated
annealing. The major contributions of the paper are: 1. A new representation of floorplans …
annealing. The major contributions of the paper are: 1. A new representation of floorplans …
[图书][B] Wiring considerations in analog VLSI systems, with application to field-programmable networks
MA Sivilotti - 1991 - search.proquest.com
This thesis develops a theoretical model for the wiring complexity of wide classes of
systems, relating the degree of connectivity of a circuit to the dimensionality of its …
systems, relating the degree of connectivity of a circuit to the dimensionality of its …
Recent advances in VLSI layout
ES Kuh, T Ohtsuki - Proceedings of the IEEE, 1990 - ieeexplore.ieee.org
The current status of VLSI layout and directions for future research are addressed, with
emphasis on the authors' own work. Necessary terminology and definitions and, whenever …
emphasis on the authors' own work. Necessary terminology and definitions and, whenever …
Rectangular duals of planar graphs
K Koźmiński, E Kinnen - Networks, 1985 - Wiley Online Library
Let one face of a cube be dissected into rectangles, no 4 of which meet at a single point. The
dual graph of this configuration is a 4‐connected triangulated plane graph. This paper …
dual graph of this configuration is a 4‐connected triangulated plane graph. This paper …
Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
In this paper we extend the concept of the regular edge labeling for general plane graphs
and for triconnected triangulated plane graphs to 4-connected triangulated plane graphs …
and for triconnected triangulated plane graphs to 4-connected triangulated plane graphs …
[图书][B] Computer aids for VLSI design
SM Rubin - 1987 - worldcolleges.info
Computer Aids for VLSI Design Page 1 Computer Aids for VLSI Design Steven M. Rubin
Copyright © 1994 Page 2 Appendix B: Caltech Intermediate Format Caltech Intermediate Format …
Copyright © 1994 Page 2 Appendix B: Caltech Intermediate Format Caltech Intermediate Format …
[PDF][PDF] A linear algorithm to find a rectangular dual of a planar triangulated graph
J Bhasker, S Sahni - Algorithmica, 1988 - cise.ufl.edu
A LINEAR ALGORITHM TO FIND A RECTANGULAR DUAL OF A PLANAR TRIANGULATED
GRAPH * Jayaram Bhasker+and Sartaj Sahni University of Mi Page 1 A LINEAR ALGORITHM …
GRAPH * Jayaram Bhasker+and Sartaj Sahni University of Mi Page 1 A LINEAR ALGORITHM …
An analytical approach to floorplan design and optimization
S Sutanthavibul, E Shragowitz, JB Rosen - … of the 27th ACM/IEEE Design …, 1991 - dl.acm.org
An analytical method for general floorplan design and optimization is proposed. This method
is based on a mixed integer programming model and application of a standard mathematical …
is based on a mixed integer programming model and application of a standard mathematical …
On finding the rectangular duals of planar triangular graphs
X He - SIAM Journal on Computing, 1993 - SIAM
This paper presents a new linear-time algorithm for finding rectangular duals of planar
triangular graphs. The algorithm is conceptually simpler than the previously known …
triangular graphs. The algorithm is conceptually simpler than the previously known …
Simultaneous floor planning and global routing for hierarchical building-block layout
WM Dai, ES Kuh - IEEE transactions on computer-aided design …, 1987 - ieeexplore.ieee.org
A new methodology for hierarchical floor planning and global routing for building block
layout is presented. Unlike the traditional approach, which separates placement and global …
layout is presented. Unlike the traditional approach, which separates placement and global …