An Algorithm for Building Rectangular Floor-Plans

Abstract

Previous reports [1] [3] have shown how to build an optimal floor-plan assembly starting with a planar structure graph in terms of components and their connections. The existing methods are based on exhaustively inspecting all possible rectangular duals until an optimal one is found. However, expensive computational resources are wasted when no rectangular dual exists. This paper presents a graph-theoretical formulation for the existence of rectangular floor-plans. It is shown that any triangulated graph (planar graph with all regions triangular) admits a rectangular dual if and only if it does not contain complex triangular faces. This result is the basis of a fast algorithm for checking admissibility of solutions.