An algorithm for exhaustive generation of building floor plans
Communications of the ACM
An automatic/interactive layout planning system for arbitrarily-sized rectangular building blocks
DAC '81 Proceedings of the 18th Design Automation Conference
The planar package planner for system designers
DAC '82 Proceedings of the 19th Design Automation Conference
Placement algorithms for arbitrarily shaped blocks
DAC '79 Proceedings of the 16th Design Automation Conference
PIAF: a knowledge-based/algorithm top-down floorplanning system
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
On floorplans of planar graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Automatic building of graphs for rectangular dualisation
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
A new algorithm for floorplan design
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
A linear algorithm to find a rectangular dual of a planar triangulated graph
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Flute—a floorplanning agent for full custom VLSI design
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
A Deterministic Approach to Linear Programs with Several Additional Multiplicative Constraints
Computational Optimization and Applications
Generalized Convex Multiplicative Programming via QuasiconcaveMinimization
Journal of Global Optimization
Journal of Global Optimization
PIAF: Efficient IC Floor Planning
IEEE Expert: Intelligent Systems and Their Applications
Some Applications of Orderly Spanning Trees in Graph Drawing
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Simple and efficient floor-planning
Information Processing Letters
DAC '84 Proceedings of the 21st Design Automation Conference
An algorithm for building rectangular floor-plans
DAC '84 Proceedings of the 21st Design Automation Conference
The planar package planner for system designers
DAC '82 Proceedings of the 19th Design Automation Conference
Global Optimization of Multiplicative Programs
Journal of Global Optimization
Adaptive Cluster Growth (ACG): a new algorithm for circuit packing in rectilinear region
EURO-DAC '90 Proceedings of the conference on European design automation
Compact floor-planning via orderly spanning trees
Journal of Algorithms
A nonisolated optimal solution of general linear multiplicative programming problems
Computers and Operations Research
Improved floor-planning of graphs via adjacency-preserving transformations
Journal of Combinatorial Optimization
Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
Operations Research Letters
An objective space cut and bound algorithm for convex multiplicative programmes
Journal of Global Optimization
| Hi-index | 0.00 |
The layout problem requires a combination of space costs and communication costs to be minimized. The special problem of planar, rectangular spaces occurs, for example, in floor plans for electronic planar packages and for buildings. Here we describe a number of algorithms, embedded in an interactive system, that solve the layout problem efficiently when it is expressed in terms of the package planning algorithm. A hierarchical approach is used to contain computational growth.