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

Authors:
Toshihiko Takahashi;Ryo Fujimaki
Affiliations:
-;-
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2008

Citing 4
Cited 0

Rectangle-packing-based module placement

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
On the number of rectangular partitions

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Space-planning: placement of modules with controlled empty area by single-sequence

Proceedings of the 2004 Asia and South Pacific Design Automation Conference
A Surjective Mapping from Permutations to Room-to-Room Floorplans*The original paper was presented at 19th Karuizawa Workshop (2006).

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.