A Surjective Mapping from Permutations to Room-to-Room Floorplans(<Special Section>Selected Papers from the 19th Workshop on Circuits and Systems in Karuizawa)

スポンサーリンク

概要

• 論文の詳細を見る

• A floorplan is a subdivision of a rectangle into rectangular faces with horizontal and vertical line segments. Heuristic search algorithms are used to find desired floorplans in applications, including sheet-cutting, scheduling, and VLSI layout design. Representation of floorplan is critical in floorplan algorithms, because it determines the solution space searched by floorplan algorithms. In this paper, we show a surjective mapping from permutations to room-to-room floorplans. This mapping gives us a simple representation of room-to-room floorplans.

• 社団法人電子情報通信学会の論文
• 2007-04-01

著者

• FUJIMAKI Ryo

  Graduate School of Science and Technology, Niigata University

• Fujimaki Ryo

  Niigata Univ. Niigata‐shi Jpn

• Fujimaki Ryo

  Graduate School Of Science And Technology Niigata University

• TAKAHASHI Toshihiko

  Graduate School of Science and Technology, Niigata University

• Takahashi Toshihiko

  Niigata Univ. Niigata‐shi Jpn

• 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)

スポンサーリンク