IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Special Section on Advanced Technologies Emerging Mainly from the 21st Workshop on Circuits and Systems in Karuizawa
Counting Rectangular Drawings or Floorplans in Polynomial Time
Youhei INOUEToshihiko TAKAHASHIRyo FUJIMAKI
著者情報
ジャーナル 認証あり

2009 年 E92.A 巻 4 号 p. 1115-1120

詳細
抄録
A subdivision of a rectangle into rectangular faces with horizontal and vertical line segments is called a rectangular drawing or floorplan. It has been an open problem to determine whether there exist a polynomial time algorithm for computing R(n). We affirmatively solve the problem, that is, we introduce an O(n4)-time and O(n3)-space algorithm for R(n). The algorithm is based on a recurrence for R(n), which is the main result of the paper. We also implement our algorithm and computed R(n) for n ≤ 3000.
著者関連情報
© 2009 The Institute of Electronics, Information and Communication Engineers
前の記事 次の記事
feedback
Top