Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Extended Rectangular Drawings of Plane Graphs with Designated Corners
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Some Applications of Orderly Spanning Trees in Graph Drawing
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Compact floor-planning via orderly spanning trees
Journal of Algorithms
A Compact Encoding of Rectangular Drawings with Efficient Query Supports
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Octagonal drawings of plane graphs with prescribed face areas
Computational Geometry: Theory and Applications
A Compact Encoding of Rectangular Drawings with Efficient Query Supports
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
GD'10 Proceedings of the 18th international conference on Graph drawing
Improved floor-planning of graphs via adjacency-preserving transformations
Journal of Combinatorial Optimization
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
GD'09 Proceedings of the 17th international conference on Graph Drawing
Linear-time algorithms for hole-free rectilinear proportional contact graph representations
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
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
Touching triangle representations for 3-connected planar graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
Proportional contact representations of 4-connected planar graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
A floor-plan is a rectangle partitioned into a set of disjoint rectilinear polygonal regions (called modules). A floor-plan F represents a plane graph G as follows: Each vertex of G corresponds to a module of F and two vertices are adjacent in G iff their corresponding modules share a common boundary. Floor-plans find applications in VLSI chip design.If a module M is a union of k disjoint rectangles, M is called a k-rectangle module. It was shown in [K.-H. Yeap and M. Sarrafzadeh, SIAM J. Comput., 22 (1993), pp. 500--526] that every triangulated plane graph G has a floor-plan using 1-, 2-, and 3-rectangle modules. In this paper, we present a simple linear time algorithm that constructs a floor-plan for G using only 1- and 2-rectangle modules.