Turning a graph into a rectangular floor plan

Abstract This paper presents a systematic pathway for the design of a floor plan when given the list of cells, the required dimensions of each cell and the matrix of required adjacencies between the cells. The first step is translating the given adjacencies matrix into a graph. The proposed algorithm deals wioth planar adjacencies graphs only. The graph representing the required adjacencies is either originally planar, or should be elaborated into a planar one. This graph is devided into two subgraphs by use of a colouring technique. Dimensions are applied to the two subgraphs using the PERT algorithm. As a result, various alternative plans are generated, composed of rectangular cells, dimensioned according to the given data and maintaining the required adjacencies. At the end, a fully elaborated example is given.