A Graph Theoretical Approach for Creating Building Floor Plans

Existing floor planning algorithms are mostly limited to rectangular room geometries. This restriction is a significant reason why they are not used much in design practice. To address this issue, we propose an algorithm (based on graph theoretic tools) that generates rectangular and, if required, orthogonal floor plans while satisfying the given adjacency requirements. If a floor plan does not exist for the given adjacency requirements, we introduce circulations within a floor plan to have a required floor plan.

[1]  Xin He,et al.  On Finding the Rectangular Duals of Planar Triangular Graphs , 1993, SIAM J. Comput..

[2]  J W Giffin,et al.  Orthogonal Floorplans from Maximal Planar Graphs , 1990 .

[3]  Majid Sarrafzadeh,et al.  Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules , 1993, SIAM J. Comput..

[4]  Philip Steadman.  Why are most buildings rectangular , 2006 .

[5]  Olga Río,et al.  Heuristic method to check the realisability of a graph into a rectangular plan , 2000 .

[6]  Sadish Sadasivam,et al.  Improved floor-planning of graphs via adjacency-preserving transformations , 2011, J. Comb. Optim..

[7]  I. Rinsma.  Rectangular and Orthogonal Floorplans with Required Room Areas and Tree Adjacency , 1988 .

[8]  Mohammad Reza Akbari Jokar,et al.  Constructing a block layout by face area , 2011 .

[9]  Krishnendra Shekhawat,et al.  Automated Best Connected Rectangular Floorplans , 2017 .

[10]  G. lusarczyk,et al.  Graph-based representation of design properties in creating building floorplans , 2018 .

[11]  Krishnendra Shekhawat,et al.  Rectilinear Floor Plans , 2017 .

[12]  J. A. Lynes,et al.  Windows and Floor Plans , 1977 .

[13]  Xin He,et al.  On Floor-Plan of Plane Graphs , 1999, SIAM J. Comput..

[14]  João Bento,et al.  Floor plan design using block algebra and constraint satisfaction , 2012, Adv. Eng. Informatics.

[15]  Sartaj Sahni,et al.  A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph , 1987, Networks.

[16]  Hsueh-I Lu,et al.  Compact floor-planning via orderly spanning trees , 2003, J. Algorithms.

[17]  Krishnendra Shekhawat,et al.  Algorithm for constructing an optimally connected rectangular floor plan , 2014 .

[18]  R. Hashimshony,et al.  Turning a graph into a rectangular floor plan , 1982 .

[19]  Charles M. Eastman,et al.  Enumerating Architectural Arrangements by Generating Their Underlying Graphs , 1980 .

[20]  Les R. Foulds,et al.  Orthogonal layouts using the deltahedron heuristic , 1995, Australas. J Comb..

[21]  Krishnendra Shekhawat,et al.  Enumerating generic rectangular floor plans , 2018, Automation in Construction.