A unified approach to topology generation and area optimization of general floorplans
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Slicibility of rectangular graphs and floorplan optimization
Proceedings of the 1997 international symposium on Physical design
Nostradamus: a floorplanner of uncertain design
ISPD '98 Proceedings of the 1998 international symposium on Physical design
Slicible rectangular graphs and their optimal floorplans
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Rectangular layouts and contact graphs
ACM Transactions on Algorithms (TALG)
Octagonal drawings of plane graphs with prescribed face areas
Computational Geometry: Theory and Applications
Drawing slicing graphs with face areas
Theoretical Computer Science
Area-universal rectangular layouts
Proceedings of the twenty-fifth annual symposium on Computational geometry
Steinitz theorems for orthogonal polyhedra
Proceedings of the twenty-sixth annual symposium on Computational geometry
Optimizing regular edge labelings
GD'10 Proceedings of the 18th international conference on Graph drawing
On rectilinear duals for vertex-weighted plane graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
A theoretical upper bound for IP-based floorplanning
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Optimal polygonal representation of planar graphs
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Octagonal drawings of plane graphs with prescribed face areas
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
Previous algorithms on rectangular dual graph floorplanning generate general floorplans which include the class of nonsliceable floorplans. We examine the framework of generating sliceable floorplans using the rectangular dual graph approach and present an algorithm that generates a sliceable floorplan if the input graph satisfies certain sufficient conditions. For general input, the algorithm is still able to generate sliceable floorplans by introducing pseudomodules where the areas occupied by the pseudomodules are used for wiring. For an $n$-vertex adjacency graph, the algorithm generates a sliceable floorplan in $O(n \log n + hn)$ time where $h$ is the height of the sliceable floorplan tree.