An algorithm to enumerate all floorplans by using Q-sequence and its applications to the boundary constraint problem

摘要

In this paper, we propose an algorithm to enumerate all floorplans by using Q-sequence which is an excellent floorplan data structure. For an application, we deal with boundary constraints such that a specified room is abutted on the specified boundary of the chip. We enumerate floorplans satisfying the constraints by the branch and bound method.