Fujimaki-Takahashi Squeeze : Linear Time Construction of Constraint Graphs of Floorplan for a Given Permutation

スポンサーリンク

概要

• 論文の詳細を見る

• A floorplan is a subdivision of a rectangle into rectangular faces with horizontal and vertical line segments. We call a floorplan room-to-room when adjacencies between rooms are considered. Fujimaki and Takahashi showed that any room-to-room floorplan can be represented as a permutation. In this paper, we give an O(n)-time algorithm that constructs the vertical and the horizontal constraint graphs of a floorplan for a given permutation under this representation.

• （社）電子情報通信学会の論文
• 2008-04-01

著者

• Fujimaki Ryo

  Graduate School Of Science And Technology Niigata University

• TAKAHASHI Toshihiko

  Graduate School of Science and Technology, Niigata University

• Takahashi Toshihiko

  Graduate School Of Science And Technology Niigata University

関連論文

• Counting Rectangular Drawings or Floorplans in Polynomial Time
• Fujimaki-Takahashi Squeeze : Linear Time Construction of Constraint Graphs of Floorplan for a Given Permutation
• A Surjective Mapping from Permutations to Room-to-Room Floorplans(Selected Papers from the 19th Workshop on Circuits and Systems in Karuizawa)

スポンサーリンク