IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa
Fujimaki-Takahashi Squeeze: Linear Time Construction of Constraint Graphs of Floorplan for a Given Permutation
Toshihiko TAKAHASHIRyo FUJIMAKI
Author information
JOURNALS RESTRICTED ACCESS

2008 Volume E91.A Issue 4 Pages 1071-1076

Details
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.

Information related to the author
© 2008 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
feedback
Top