{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T03:40:22Z","timestamp":1738640422834,"version":"3.35.0"},"reference-count":45,"publisher":"Cambridge University Press (CUP)","license":[{"start":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T00:00:00Z","timestamp":1738627200000},"content-version":"unspecified","delay-in-days":34,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["AIEDAM"],"published-print":{"date-parts":[[2025]]},"abstract":"<jats:title>Abstract<\/jats:title>\n\t  <jats:p>The generation of floor plan layouts has been extensively studied in recent years, driven by the need for efficient and functional architectural designs. Despite significant advancements, existing methods often face limitations when dealing with specific input adjacency graphs or room shapes and boundary layouts. When adjacency graphs contain separating triangles, the floor plan must include rectilinear rooms (non-rectangular rooms with concave corners). From a design perspective, minimizing corners or bends in rooms is crucial for functionality and aesthetics. In this article, we present a Python-based application called G-Drawer for automatically generating floor plans with a minimum number of bends. G-Drawer takes any plane triangulated graph as an input and outputs a floor plan layout with minimum bends. It prioritizes generating a rectangular floor plan (RFP); if an RFP is not feasible, it then generates an orthogonal floor plan or an irregular floor plan. G-Drawer modifies orthogonal drawing techniques based on flow networks and applies them on the dual graph of a given PTG to generate the required floor plans. The results of this article demonstrate the efficacy of G-Drawer in creating efficient floor plans. However, in future, we need to work on generating multiple dimensioned floor plans having non-rectangular rooms as well as non-rectangular boundary. These enhancements will address both mathematical and architectural challenges, advancing the automated generation of floor plans toward more practical and versatile applications.<\/jats:p>","DOI":"10.1017\/s0890060424000179","type":"journal-article","created":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T03:22:21Z","timestamp":1738639341000},"update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["Automated generation of floor plans with minimum bends"],"prefix":"10.1017","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8388-4216","authenticated-orcid":false,"family":"Pinki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3408-7912","authenticated-orcid":false,"given":"Krishnendra","family":"Shekhawat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akshat","family":"Lal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2025,2,4]]},"reference":[{"key":"S0890060424000179_r12","volume-title":"Graph Drawing","volume":"357","author":"Di Battista","year":"1999"},{"key":"S0890060424000179_r16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.00764"},{"key":"S0890060424000179_r26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.03.032"},{"key":"S0890060424000179_r35","doi-asserted-by":"publisher","DOI":"10.1068\/b150111"},{"key":"S0890060424000179_r11","first-page":"491","article-title":"Topological organization of architectural spaces","volume":"40","author":"Cousin","year":"1970","journal-title":"Architectural Design"},{"key":"S0890060424000179_r23","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00490-8"},{"key":"S0890060424000179_r25","first-page":"809","article-title":"Use of graphs to decide the optimum layout of buildings","volume":"7","author":"Levin","year":"1964","journal-title":"The Architects\u2019 Journal"},{"key":"S0890060424000179_r36","doi-asserted-by":"publisher","DOI":"10.1016\/j.gmod.2023.101175"},{"key":"S0890060424000179_r37","doi-asserted-by":"publisher","DOI":"10.1016\/j.autcon.2021.103718"},{"key":"S0890060424000179_r38","doi-asserted-by":"publisher","DOI":"10.1017\/S1359135506000200"},{"key":"S0890060424000179_r39","doi-asserted-by":"publisher","DOI":"10.1007\/BF01891831"},{"key":"S0890060424000179_r44","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3355089.3356556","article-title":"Data-driven interior plan generation for residential buildings","volume":"38","author":"Wu","year":"2019","journal-title":"ACM Transactions on Graphics (TOG)"},{"key":"S0890060424000179_r20","doi-asserted-by":"crossref","unstructured":"Klawitter, J , Klesen, F and Wolff, A (2021) Algorithms for floor planning with proximity requirements. arXiv preprint arXiv:2107.05036.","DOI":"10.1007\/978-981-19-1280-1_10"},{"key":"S0890060424000179_r9","first-page":"515","volume-title":"International Symposium on Graph Drawing","author":"Brandenburg","year":"2003"},{"key":"S0890060424000179_r29","unstructured":"Nauata, N , Hosseini, S , Chang, K-H , Chu, H , Cheng, C-i , and Furukawa, Y (2021) House-gan++: Generative adversarial layout refinement networks. arXiv preprint arXiv:2103.02574."},{"key":"S0890060424000179_r32","first-page":"6690","volume-title":"Proceedings of the IEEE\/CVF International Conference on Computer Vision","author":"Para","year":"2021"},{"key":"S0890060424000179_r33","first-page":"673","article-title":") Linear-time construction of floor plans for plane triangulations","volume":"8","author":"Pinki","year":"2022a","journal-title":"Communications in Combinatorics and Optimization"},{"key":"S0890060424000179_r17","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796308874"},{"key":"S0890060424000179_r21","volume-title":"A Generic Framework for the Topology-Shapemetrics Based Layout","author":"Klose","year":"2012"},{"key":"S0890060424000179_r2","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-013-9521-1"},{"key":"S0890060424000179_r10","first-page":"86","volume-title":"Combinatorial Optimization and Applications. COCOA 2014. Lecture Notes in Computer Science","volume":"8881","author":"Chang","year":"2014"},{"key":"S0890060424000179_r14","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794277123"},{"key":"S0890060424000179_r8","unstructured":"Boyer, JM and Myrvold, WJ (1999) Stop minding your p\u2019s and q\u2019s: A simplified o (n) planar embedding algorithm. In Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, ACM, pp. 140\u2013146."},{"key":"S0890060424000179_r13","unstructured":"Duarte, JP (2001) Customizing mass housing: A discursive grammar for siza\u2019s malagueira houses."},{"key":"S0890060424000179_r3","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-021-02155-w"},{"key":"S0890060424000179_r24","doi-asserted-by":"publisher","DOI":"10.1016\/j.autcon.2020.103491"},{"key":"S0890060424000179_r19","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-010-2960-4"},{"key":"S0890060424000179_r30","volume-title":"9th International Space Syntax Symposium, SSS 2013","author":"Nourian","year":"2013"},{"key":"S0890060424000179_r5","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230170306"},{"key":"S0890060424000179_r43","doi-asserted-by":"crossref","unstructured":"Wu, F , Yan, D-M , Dong, W , Zhang, X and Wonka, P (2013) Inverse procedural modeling of facade layouts. arXiv preprint arXiv:1308.0419.","DOI":"10.1145\/2601097.2601162"},{"key":"S0890060424000179_r45","doi-asserted-by":"publisher","DOI":"10.1137\/0222035"},{"key":"S0890060424000179_r18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3414685.3417764","article-title":"Graph2plan: Learning floorplan generation from layout graphs","volume":"39","author":"Hu","year":"2020","journal-title":"ACM Transactions on Graphics (TOG)"},{"key":"S0890060424000179_r27","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195906002026"},{"key":"S0890060424000179_r7","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.14451"},{"key":"S0890060424000179_r22","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230150202"},{"key":"S0890060424000179_r31","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90349-K"},{"key":"S0890060424000179_r42","doi-asserted-by":"publisher","DOI":"10.1016\/j.autcon.2020.103149"},{"key":"S0890060424000179_r34","first-page":"1","volume-title":"Proceedings of the 6th International Conference on Algorithms, Computing and Systems","author":"Pinki","year":"2022b"},{"key":"S0890060424000179_r28","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276484"},{"key":"S0890060424000179_r40","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90059-Q"},{"key":"S0890060424000179_r4","doi-asserted-by":"publisher","DOI":"10.1068\/b070289"},{"key":"S0890060424000179_r6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01762117"},{"key":"S0890060424000179_r41","unstructured":"Ueckerdt, T (2012) Geometric representations of graphs with low polygonal complexity. Phd thesis, Department of Mathematics at TU Berlin. https:\/\/i11www.iti.kit.edu\/_media\/members\/ torsten_ueckerdt\/torsten_ueckerdt-phd_thesis.pdf\/."},{"key":"S0890060424000179_r15","first-page":"170","article-title":"A dual linear graph representation for space-filling location problems of the floor plan type","author":"Grason","year":"1970","journal-title":"Emerging Methods in Environmental Design and Planning, Proceedings of The Design Methods Group, 1st International Conference"},{"key":"S0890060424000179_r1","doi-asserted-by":"publisher","DOI":"10.1016\/S0927-0507(89)01005-4"}],"container-title":["Artificial Intelligence for Engineering Design, Analysis and Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0890060424000179","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T03:22:32Z","timestamp":1738639352000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0890060424000179\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":45,"alternative-id":["S0890060424000179"],"URL":"https:\/\/doi.org\/10.1017\/s0890060424000179","relation":{},"ISSN":["0890-0604","1469-1760"],"issn-type":[{"value":"0890-0604","type":"print"},{"value":"1469-1760","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"\u00a9 The Author(s), 2025. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http:\/\/creativecommons.org\/licenses\/by\/4.0), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}],"article-number":"e3"}}