Hostname: page-component-77c78cf97d-hf2s2 Total loading time: 0 Render date: 2026-05-05T01:57:46.574Z Has data issue: false hasContentIssue false
  • English
  • Français

Graph-based approach for enumerating floorplans based on users specifications

Published online by Cambridge University Press:  02 February 2022

Krishnendra Shekhawat Open the ORCID record for Krishnendra Shekhawat [Opens in a new window] ,
Rahil N. Jain ,
Sumit Bisht ,
Aishwarya Kondaveeti  and
Dipam Goswami
Krishnendra Shekhawat*
Affiliation:
Department of Mathematics, BITS Pilani, Pilani Campus 333031, India
Rahil N. Jain
Affiliation:
Department of Mathematics, BITS Pilani, Pilani Campus 333031, India
Sumit Bisht
Affiliation:
Department of Mathematics, BITS Pilani, Pilani Campus 333031, India
Aishwarya Kondaveeti
Affiliation:
Department of Mathematics, BITS Pilani, Pilani Campus 333031, India
Dipam Goswami
Affiliation:
Department of Mathematics, BITS Pilani, Pilani Campus 333031, India
*
Author for correspondence: Krishnendra Shekhawat, E-mail: krishnendra.iitd@gmail.com
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper aims at automatically generating dimensioned floorplans while considering constraints given by the users in the form of adjacency and connectivity graph. The obtained floorplans also satisfy boundary constraints where users will be asked to choose their preferred location based on cardinal and inter-cardinal directions. Further, spanning circulations are inserted within the generated floorplans. The larger aim of this research is to provide alternative architecturally feasible layouts to users which can be further refined by architects.

Keywords

Algorithmcirculationfloorplansgraph theorylayoutssymmetry

Information

Type
Research Article
Information
AI EDAM , Volume 35 , Issue 4 , November 2021 , pp. 438 - 459
Check for updates
Copyright
Copyright © The Author(s), 2022. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Alam, MJ, Biedl, T, Felsner, S, Kaufmann, M, Kobourov, S and Ueckerdt, T (2013) Computing cartograms with optimal complexity. Discrete & Computational Geometry 50, 784–810. doi:10.1007/s00454-013-9521-1Google Scholar
Baybars, I (1982) The generation of floor plans with circulation spaces. Environment and Planning B 9, 445–456. doi:10.1068/b090445CrossRefGoogle Scholar
Berry, A, Blair, JRS, Heggernes, P and Peyton, BW (2004) Maximum cardinality search for computing minimal triangulations of graphs. Algorithmica 39, 287–298.CrossRefGoogle Scholar
Bhasker, J and Sahni, S (1987) A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph. Networks 17, 307–317. doi:10.1002/net.3230170306CrossRefGoogle Scholar
Bhasker, J and Sahni, S (1988) A linear algorithm to find a rectangular dual of a planar triangulated graph. Algorithmica 3, 247–278. doi:10.1007/BF01762117Google Scholar
Duarte, JP (2005) A discursive grammar for customizing mass housing: the case of siza's houses at malagueira. Automation in Construction 14, 265–275. doi:10.1016/j.autcon.2004.07.013CrossRefGoogle Scholar
Egor, G, Sven, S, Martin, D and Reinhard, K (2020) Computer-aided approach to public buildings floor plan generation. Magnetizing floor plan generator. Procedia Manufacturing 44, 132–139. doi:10.1016/j.promfg.2020.02.214CrossRefGoogle Scholar
Eppstein, D, Mumford, E, Speckmann, B and Verbeek, K (2012) Area-universal and constrained rectangular layouts. SIAM Journal on Computing 41, 537–564. doi:10.1137/110834032CrossRefGoogle Scholar
Hu, R, Huang, Z, Tang, Y, Matias, O, Kaick, V, Zhang, H and Huang, H (2020) Graph2plan: learning floorplan generation from layout graphs. ACM Transactions on Graphics 39, 1–14. doi:10.1145/3386569.3392391Google Scholar
Kahng, AB, Lienig, J, Markov, IL and Hu, J (2011) VLSI Physical Design: From Graph Partitioning to Timing Closure. Dordrecht: Springer Science & Business Media.Google Scholar
Kant, G and He, X (1993) Two algorithms for finding rectangular duals of planar graphs. In van Leeuwen J (ed.), Graph-Theoretic Concepts in Computer Science. WG 1993. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, pp. 396–410. doi:10.1007/3-540-57899-4_69CrossRefGoogle Scholar
Koźmiński, K and Kinnen, E (1985) Rectangular duals of planar graphs. Networks 15, 145–157. doi:10.1002/net.3230150202CrossRefGoogle Scholar
Laignel, G, Pozin, N, Geffrier, X, Delevaux, L, Brun, F and Dolla, B (2021) Floor plan generation through a mixed constraint programming-genetic optimization approach. Automation in Construction 123, 1–21. doi:10.1016/j.autcon.2020.103491CrossRefGoogle Scholar
Levin, PH (1964) Use of graphs to decide the optimum layout of buildings. The Architects’ Journal 7, 809–815.Google Scholar
Liao, CC, Lu, HI and Yen, HC (2003) Compact floor-planning via orderly spanning trees. Journal of Algorithms 48, 441–451. 10.1016/S0196-6774(03)00057-9CrossRefGoogle Scholar
Ma, C, Vining, N, Lefebvre, S and Sheffer, A (2014) Game level layout from design specification. EUROGRAPHICS 33, 95–104. doi.org/10.1111/cgf.12314Google Scholar
Marson, F and Musse, SR (2010) Automatic real-time generation of floor plans based on squarified treemaps algorithm. International Journal of Computer Games Technology 2010. doi:10.1155/2010/624817CrossRefGoogle Scholar
Merrell, P, Schkufza, E and Koltun, V (2010) Computer-generated residential building layouts. ACM Transactions on Graphics 29, 1–12. doi:10.1145/1882261.1866203CrossRefGoogle Scholar
Mitchel, WJ (1990) The Logic of Architecture (Design Computation and Cognition). Cambridge, MA: MIT Press.Google Scholar
Mitchell, WJ, Steadman, P and Liggett, RS (1976) Synthesis and optimization of small rectangular floor plans. Environment and Planning B: Planning and Design 3, 37–70. doi:10.1068/b030037Google Scholar
Müller, P, Zeng, G, Wonka, P and Van, GL (2007) Image-based procedural modeling of facades. ACM Transactions on Graphics 26, 1–9. doi:10.1145/1276377.1276484CrossRefGoogle Scholar
Nisztuk, M and Myszkowski, PB (2019) Hybrid evolutionary algorithm applied to automated floor plan generation. International Journal of Architectural Computing 17, 260–283. doi:10.1177/1478077119832982Google Scholar
Rinsma, I (1987) Nonexistence of a certain rectangular floorplan with specified areas and adjacency. Environment and Planning B 14, 163–166. doi:10.1068/b140163CrossRefGoogle Scholar
Rodrigues, E, Gaspar, AR and Gomes, Á (2013) An evolutionary strategy enhanced with a local search technique for the space allocation problem in architecture, part 2: Validation and performance tests. Computer-Aided Design 45, 898–910. doi:10.1016/j.cad.2013.01.003Google Scholar
Roth, J, Hashimshony, R and Wachman, A (1982) Turning a graph into a rectangular floor plan. Building and Environment 17, 163–173. doi:10.1016/0360-1323(82)90037-3Google Scholar
Shekhawat, K (2018) Enumerating generic rectangular floor plans. Automation in Construction 92, 151–165. doi:10.1016/j.autcon.2018.03.037Google Scholar
Shekhawat, K and Duarte, JP (2018) Introduction to generic rectangular floor plans. AIEDAM: Artificial Intelligence for Engineering Design, Analysis and Manufacturing 32, 331–350. doi.org/10.1017/S0890060417000671CrossRefGoogle Scholar
Shekhawat, K, Upasani, N, Bisht, S and Jain, RN (2021) A tool for computer-generated dimensioned floorplans based on given adjacencies. Automation in Construction 127, 1–22. doi.org/10.1016/j.autcon.2021.103718CrossRefGoogle Scholar
Shi, F, Soman, RK, Han, J and Whyte, JK (2020) Addressing adjacency constraints in rectangular floor plans using Monte-Carlo tree search. Automation in Construction 115, 1–14. doi:10.1016/j.autcon.2020.103187Google Scholar
Steadman, P (1973) Graph theoretic representation of architectural arrangement. Architectural Research and Teaching 2, 161–172.Google Scholar
Upasani, N, Shekhawat, K and Sachdeva, G (2020) Automated generation of dimensioned rectangular floorplans. Automation in Construction 113, 1–11. doi:10.1016/j.autcon.2020.103149Google Scholar
Wang, X-Y and Zhang, K (2020) Generating layout designs from high-level specifications. Automation in Construction 119, 1–12. doi:10.1016/j.autcon.2020.103288Google Scholar
Wang, X-Y, Yang, Y and Zhang, K (2018) Customization and generation of floor plans based on graph transformations. Automation in Construction 94, 405–416. doi:10.1016/j.autcon.2018.07.017Google Scholar
Wu, F, Yan, D-M, Dong, W, Zhang, X and Wonka, P (2014) Inverse procedural modeling of facade layouts. ACM Transactions on Graphics 33, 1–10. doi:10.1145/2601097.2601162Google Scholar
Wu, W, Fan, L, Liu, L and Wonka, P (2018) Miqp-based layout design for building interiors. Computer Graphics Forum 37, 511–521. doi:10.1111/cgf.13380Google Scholar
Wu, W, Fu, X-M, Tang, R, Wang, Y, Qi, Y-H and Liu, L (2019) Data-driven interior plan generation for residential buildings. ACM Transactions on Graphics 38, 1–12. doi.org/10.1145/3355089.3356556Google Scholar
Yeap, KH and Sarrafzadeh, M (1993) Floor-planning by graph dualization: 2-concave rectilinear modules. SIAM Journal on Computing 22, 500–526. doi:10.1137/0222035CrossRefGoogle Scholar

Shekhawat et al. supplementary material

Shekhawat et al. supplementary material

Download Shekhawat et al. supplementary material(Video)
Video 11 MB