A compact algorithm for placement design using corner block list representation

Corner Block List (CBL) was recently proposed as an efficient representation of general packing of rectangles. Although the original method is really innovative, there still remains room of improvement. This paper proposes a compact algorithm for placement based on corner block list. By introducing the dummy blocks in CBL, our algorithm can intellective employ dummy blocks in the packing to represent the placement including empty rooms, which corner block list cannot represent. Our algorithm can obtain the fast convergence to an optimal solution, and at the end of packing, not only the compact packing but also the corresponding CBL can be obtained. The experiment results are demonstrated by some benchmark data and the performance shows effectiveness of the proposed method