Sciweavers

Share
ISPD
1998
ACM

Topology constrained rectilinear block packing for layout reuse

9 years 8 months ago
Topology constrained rectilinear block packing for layout reuse
In this paper, we formulate the problem of topology constrained rectilinear block packing in layout reuse. A speci c class of rectilinear shaped blocks, ordered convex rectilinear blocks, is represented in bounded slicing grid BSG structure. The Non-overlapped packing is guaranteed. Based on both sequence pair SP and BSG structures, we propose an algorithm to compact the ordered convex blocks under the topological constraints, in which the x and y directions are independently compacted. By augumenting or further partitioning the arbitrary rectilinear blocks into the ordered convex shapes, this method can be extended to handle the topology constrained rectilinear block packing. Furthermore, our recent theoretical progress is brie y reported at the end of this paper, in which arbitrarily rectilinear shaped blocks are represented in SP structure. Three necessary and su cient constraints are derived on the sequence pair, such that the non-overlapping compaction is guaranteed.
Maggie Zhiwei Kang, Wayne Wei-Ming Dai
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Where ISPD
Authors Maggie Zhiwei Kang, Wayne Wei-Ming Dai
Comments (0)
books