A general packing algorithm based on single-sequence

The single-sequence (SS) is simply a sequence of integers 1, 2, 3, ..., n. But it leads a unique set of ABLR-relations (above, below, left-of, right-of) that hold among n objects on a plane. The direct relation set (DRS) is used to represent the direct ABLR-relations among rooms. It can be reused for any packing under the same floorplan. In this paper we analyze the relation between DRS and SS, and propose a general packing algorithm based on SS. It can update each room´s coordinates on the fly. As a feature of SS, this algorithm covers all possible placements, if our objective is in bounding-box area minimization. Experimental results showed that the proposed algorithm is pretty fast and efficient compared with the performance attained by conventional algorithms.