The planar package planner for system designers
DAC '82 Proceedings of the 19th Design Automation Conference
On finding most optimal rectangular package plans
DAC '82 Proceedings of the 19th Design Automation Conference
An analytical approach to floorplan design and optimization
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Automatic building of graphs for rectangular dualisation
DAC '88 Proceedings of the 25th 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
PIAF: Efficient IC Floor Planning
IEEE Expert: Intelligent Systems and Their Applications
Rectangular Drawings of Plane Graphs Without Designated Corners
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Extended Rectangular Drawings of Plane Graphs with Designated Corners
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Rectangular Drawings of Planar Graphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Box-Rectangular Drawings of Plane Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Rectangular drawings of planar graphs
Journal of Algorithms
An extended representation of Q-sequence for optimizing channel-adjacency and routing-cost
ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
Euclidean representation of 3D electronic institutions: automatic generation
Proceedings of the working conference on Advanced visual interfaces
From graphs to Euclidean virtual worlds: visualization of 3D electronic institutions
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Exploring adjacency in floorplanning
Proceedings of the 2009 Asia and South Pacific Design Automation Conference
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
Proceedings of the 19th ACM Great Lakes symposium on VLSI
A graph-theoretic approach to constrained floor plan estimation from radar measurements
IEEE Transactions on Signal Processing
Complexity of 3-D floorplans by analysis of graph cuboidal dual hardness
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Rectangular-radial drawings of cubic plane graphs
Computational Geometry: Theory and Applications
Inner rectangular drawings of plane graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
The graphs of planar soap bubbles
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
An O(n2) algorithm for finding a rectangular dual of a planar triangulated graph is presented. In practice, almost linear running times have been observed. The algorithm is useful for solving area planning problems in VLSI IC design.