Enumerating Floorplans with n Rooms(VLSI Design Technology and CAD)

スポンサーリンク

概要

• 論文の詳細を見る

• Aplane 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) spaice 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. Also we can generate without duplications all (non-based) floorplans having exactly n faces in O(n) time per floorplan.

• 一般社団法人電子情報通信学会の論文
• 2002-07-01

著者

• Nakano Sin-ichi

  Department Of Computer Science Faculty Of Engineering Gunma University

関連論文

• Enumerating Floorplans with n Rooms(VLSI Design Technology and CAD)

スポンサーリンク