出版社：The Editorial Committee of the Interdisciplinary Information Sciences
摘要：A plane drawing of a graph is called a floorplan if every face (including the outer face) is a rectangle. A based floorplan is a floorplan with a designated base line segment on the outer face. In this paper we give a simple algorithm to generate all based floorplans with at most n faces. The algorithm uses O(n) space and generates such floorplans in O(1) time per floorplan without duplications. The algorithm does not output entire floorplans but the difference from the previous floorplan. By modifying the algorithm we can generate without duplications all based floorplans having exactly n faces in O(1) time per floorplan, and all (non-based) floorplans having exactly n faces in O(n) time per floorplan. Also, given three integers n, k1 and k2, we can generate all based floorplans with exactly n faces containing at least k1 and at most k2 inner rooms in O(1) time per floorplan, where an inner room means a face which does not contain a line segment of the contour of the outer face.
