Topology constrained rectilinear block packing for layout reuse

In this paper, we formulate the problem of top olo gy constrained rectiline ar blo ck packing in la yout reuse. A specific class of rectilinear shaped blocks, ordered convex r ectiline ar blo cks, is represen ted in bounded slicing grid (BSG) structure. The Non-overlapped pac king is guaranteed. Based on both sequence pair (SP) and BSG structures, w e propose an algorithm to compact the ordered con vexbloc ks under the topological constrain ts, in whic hthe x and y directions are independently compacted. By augumenting or further partitioning the arbitrary rectilinear blocks in to the ordered con vexshapes, this method can be extended to handle the topology constrained rectilinear block pac king. Furthermore, our recent theoretical progress is briefly reported at the end of this paper, in which arbitrarily rectilinear shaped blocks are represented in SP structure. Three necessary and sufficient constrain ts are deriv ed on the sequence pair, such that the non-overlapping compaction is guaranteed.