A fast algorithm for rectilinear block packing based on selected sequence-pair

We propose a fast algorithm to obtain a rectilinear block packing in O((p+1)n) time keeping all the constrains imposed by a given SSP, a conventional method to represent arbitrary rectangle packing. Here, p is the number of rectilinear blocks without simple rectangles, and n is that of rectangle sub-blocks obtained by partitioning each rectilinear block including simple rectangles.