DocumentCode
1370140
Title
Embedding rectangular grids into square grids
Author
Ellis, John A.
Author_Institution
Dept. of Comput. Sci., Victoria Univ., BC, Canada
Volume
40
Issue
1
fYear
1991
fDate
1/1/1991 12:00:00 AM
Firstpage
46
Lastpage
52
Abstract
It is shown that two-dimensional rectangular grids of large aspect ratio can be embedded into rectangular grids of smaller aspect ratios with small expansion and dilation. In particular, width can be reduced by a factor of up to two with optimal expansion, i.e. when the host rectangle is the smallest sufficient to contain the guest, and optimal dilation, i.e., two. A width reduction factor of three can be obtained with optimal expansion and dilation three. In general, any rectangular grid can be embedded into a square grid that is no more than unity larger on the side than the minimum possible, with dilation no more than three. These results improve on those previously obtained, in which dilation of better than 18 could not be guaranteed. They might be applicable to more complex grid embedding problems, such as embedding multidimensional grids into hypercubes
Keywords
graph theory; hypercube networks; hypercubes; large aspect ratio; multidimensional grids; rectangular grids embedding; square grids; width reduction factor; Circuit simulation; Computational modeling; Computer science; Computer simulation; Cost function; Hypercubes; Multidimensional systems; Parallel processing; Size measurement; Very large scale integration;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.67319
Filename
67319
Link To Document