It is shown that it is always possible to construct an orthogonal floorplan satisfying the area and adjacency requirements of any vertex-weighted maximal planar graph which is its dual.
GiffinJ W, 1984Graph Theoretic Techniques for Facilities Layout unpublished PhD dissertation, Department of Operations Research, University of Canterbury, Christchurch
3.
GiffinJ WKeenanD WFouldsL R, 1989, “Block-plan construction from deltahedra-based adjacency graphs” working paper, Department of Mathematics and Statistics, Massey University, Palmerston North, New Zealand
4.
RinsmaI, 1988, “Rectangular and orthogonal floorplans with required room areas and tree adjacency”Environment and Planning B: Planning and Design15111–118
5.
SysloM M, 1979, “Characterizations of outerplanar graphs”Discrete Mathematics2647–53
