On finding most optimal rectangular package plans
DAC '82 Proceedings of the 19th Design Automation Conference
Canonical embedding of rectangular duals with applications to VLSI floorplanning
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
On floorplans of planar graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
ISPD '00 Proceedings of the 2000 international symposium on Physical design
Planar open rectangle-of-influence drawings with non-aligned frames
GD'11 Proceedings of the 19th international conference on Graph Drawing
On the bend-number of planar and outerplanar graphs
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Computing cartograms with optimal complexity
Proceedings of the twenty-eighth annual symposium on Computational geometry
On representing graphs by touching cuboids
GD'12 Proceedings of the 20th international conference on Graph Drawing
Edge-Weighted contact representations of planar graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
The graphs of planar soap bubbles
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
Previous reports [1, 3] have shown how to build an optimal floor-plan assembly starting with a planar structure graph in terms of components and their connections. The existing methods are based on exhaustively inspecting all possible rectangular duals until an optimal one is found. However, expensive computational resources are wasted when no rectangular dual exists. This paper presents a graph-theoretical formulation for the existence of rectangular floor-plans. It is shown that any triangulated graph (planar graph with all regions triangular) admits a rectangular dual if and only if it does not contain complex triangular faces. This result is the basis of a fast algorithm for checking admissibility of solutions.