On Embeddings of Rectangles into Optimal Squares

Let G = h x w be a rectangular grid and H = s x s be the optimal sqaure grid for G, i.e., the least square grid which is no less than G in size. In this paper, an embedding scheme is presented for embedding G into H such that the dilation cost is at most 6. The significance of this result is that optimal expansion is always achieved, regardless of the aspect ratio of the rectangle, while keeping the dilation constant.

[1]  Charles E. Leiserson,et al.  Area-Efficient Graph Layouts (for VLSI) , 1980, FOCS.

[2]  John A. Ellis Embedding Rectangular Grids into Square Grids , 1988, AWOC.

[3]  Rami G. Melhem,et al.  Embedding Rectangular Grids into Square Grids with Dilation Two , 1990, IEEE Trans. Computers.

[4]  Charles E. Leiserson,et al.  Area-efficient graph layouts , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[5]  Arnold L. Rosenberg,et al.  On Embedding Rectangular Grids in Square Grids , 1982, IEEE Transactions on Computers.

[6]  Shou-Hsuan Stephen Huang,et al.  A new combinatorial approach to optimal embeddings of rectangles , 1994, Proceedings of 8th International Parallel Processing Symposium.