Arbitrary convex and concave rectilinear block packing using sequence-pair

The sequence-pair was proposed in 1994 as a representation of the packing of rectangles of general structure. Since then, there have been eorts to expand its applicability over simple rectangles. This paper proposes a new way to represent the packing of a set of rectilinear blocks, including arbitrary concave rectilinear blocks. Our idea is in representation of a general block by a collection of rectangle blocks with additional constraints. Some sequence-pairs of rectangle blocks with such constraints may not be feasible, i.e. there is no corresponding packing. A necessary and sucient condition of feasible sequence-pair is given by the properties of the horizontal and vertical constraint graphs. Furthermore, it is proved that any packing is represented by a feasible sequence-pair. The condition includes dimensions of blocks involved. However, for L-shaped blocks, an idea is given to represent them only in terms of the topology of the sequence-pair. A packing algorithm is designed as...

• Type: Conference
• Year: 1999
• Where: ISPD
• Authors: Kunihiro Fujiyoshi, Hiroshi Murata
• Keywords: Concave Rectilinear Blocks, Hardware, ISPD 1999, Rectangle Blocks, Rectilinear Blocks