{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T09:54:56Z","timestamp":1763978096055,"version":"3.37.3"},"publisher-location":"Singapore","reference-count":28,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811384097"},{"type":"electronic","value":"9789811384103"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-981-13-8410-3_1","type":"book-chapter","created":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T19:04:10Z","timestamp":1560366250000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Graph Theoretical Approach for Creating Building Floor Plans"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3408-7912","authenticated-orcid":false,"given":"Krishnendra","family":"Shekhawat","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8388-4216","authenticated-orcid":false,"family":"Pinki","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3826-3987","authenticated-orcid":false,"given":"Jos\u00e9 P.","family":"Duarte","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,21]]},"reference":[{"key":"1_CR1","first-page":"809","volume":"7","author":"PH Levin","year":"1964","unstructured":"Levin, P.H.: Use of graphs to decide the optimum layout of buildings. Archit. J. 7, 809\u2013817 (1964)","journal-title":"Archit. J."},{"key":"1_CR2","first-page":"491","volume":"40","author":"J Cousin","year":"1970","unstructured":"Cousin, J.: Topological organization of architectural spaces. Architectural Des. 40, 491\u2013493 (1970)","journal-title":"Architectural Des."},{"key":"1_CR3","first-page":"170","volume-title":"Emerg. Methods Environ. Des. Plann.","author":"J Grason","year":"1970","unstructured":"Grason, J.: A dual linear representation for space filling location problems of the floorplan type. In: Moore, G.T. (ed.) Emerg. Methods Environ. Des. Plann., pp. 170\u2013178. MIT Press, Cambridge (1970)"},{"issue":"3","key":"1_CR4","first-page":"161","volume":"2","author":"JP Steadman","year":"1973","unstructured":"Steadman, J.P.: Graph theoretic representation of architectural arrangement. Architect. Res. Teach. 2(3), 161\u2013172 (1973)","journal-title":"Architect. Res. Teach."},{"key":"1_CR5","unstructured":"Sauda, E.J.: Computer program for the generation of dwelling unit floor plans. March thesis, University of California, Los Angeles-Architecture (1975)"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1068\/b040051","volume":"4","author":"JA Lynes","year":"1977","unstructured":"Lynes, J.A.: Windows and floor plans. Environ. Plan. B. 4, 51\u201355 (1977)","journal-title":"Environ. Plan. B."},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1068\/b070289","volume":"7","author":"I Baybars","year":"1980","unstructured":"Baybars, I., Eastman, C.M.: Enumerating architectural arrangements by generating their underlying graphs. Environ. Plan. B. 7, 289\u2013310 (1980)","journal-title":"Environ. Plan. B."},{"issue":"3","key":"1_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0360-1323(82)90037-3","volume":"17","author":"J Roth","year":"1982","unstructured":"Roth, J., Hashimshony, R., Wachman, A.: Turning a graph into a rectangular floor plan. Build. Environ. 17(3), 163\u2013173 (1982)","journal-title":"Build. Environ."},{"key":"1_CR9","volume-title":"Critical Path Method","author":"PE Radcliffe","year":"1967","unstructured":"Radcliffe, P.E., Kawal, D.E., Stephenson, R.J.: Critical Path Method, vol. III. Cahner, Chicago (1967)"},{"key":"1_CR10","unstructured":"Robinson, D.F., Janjic, I.: The constructability of floorplans with certain given outerplanar adjacency graph and room areas. In: Proceedings Xth British Combinatorics Conference, Ars Combinatoria, vol. 20B, pp. 133\u2013142 (1985)"},{"issue":"3","key":"1_CR11","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/net.3230170306","volume":"17","author":"J Bhasker","year":"1987","unstructured":"Bhasker, J., Sahni, S.: A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph. Networks 17(3), 307\u2013317 (1987)","journal-title":"Networks"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1068\/b150111","volume":"15","author":"I Rinsma","year":"1988","unstructured":"Rinsma, I.: Rectangular and orthogonal floorplans with required room areas and tree adjacency. Environ. Plan. B: Plan. Des. 15, 111\u2013118 (1988)","journal-title":"Environ. Plan. B: Plan. Des."},{"key":"1_CR13","first-page":"67","volume":"174","author":"I Rinsma","year":"1990","unstructured":"Rinsma, I., Giffin, J.W., Robinson, D.F.: Orthogonal floorplans from maximal planar graphs. Environ. Plan. B: Plan. Des. 174, 67\u201371 (1990)","journal-title":"Environ. Plan. B: Plan. Des."},{"issue":"3","key":"1_CR14","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1137\/0222035","volume":"22","author":"K-H Yeap","year":"1993","unstructured":"Yeap, K.-H., Sarrafzadeh, M.: Floor-planning by graph dualization: 2-concave rectilinear modules. SIAM J. Comput. 22(3), 500\u2013526 (1993)","journal-title":"SIAM J. Comput."},{"key":"1_CR15","first-page":"127","volume":"12","author":"JW Giffin","year":"1995","unstructured":"Giffin, J.W., Watson, K., Foulds, L.R.: Orthogonal layouts using the deltahedron heuristic. Australas. J. Comb. 12, 127\u2013144 (1995)","journal-title":"Australas. J. Comb."},{"issue":"6","key":"1_CR16","doi-asserted-by":"publisher","first-page":"2150","DOI":"10.1137\/S0097539796308874","volume":"28","author":"X He","year":"1999","unstructured":"He, X.: On floor-plan of plane graphs. SIAM J. Comput. 28(6), 2150\u20132167 (1999)","journal-title":"SIAM J. Comput."},{"key":"1_CR17","unstructured":"Recuero, A., R\u00edo, O., Alvarez, M.: Heuristic method to check the realisability of a graph into a rectangular plan. Adv. Eng. Soft. 31, 223\u2013231 (2000)"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/S0196-6774(03)00057-9","volume":"48","author":"C-C Liao","year":"2003","unstructured":"Liao, C.-C., Lu, H.-I., Yen, H.-C.: Compact floor-planning via orderly spanning trees. J. Algorithm 48, 441\u2013451 (2003)","journal-title":"J. Algorithm"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/s00170-010-2960-4","volume":"54","author":"MRA Jokar","year":"2011","unstructured":"Jokar, M.R.A., Sangchooli, A.S.: Constructing a block layout by face area. Int. J. Manuf. Technol. 54, 801\u2013809 (2011)","journal-title":"Int. J. Manuf. Technol."},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1007\/s10878-010-9324-8","volume":"22","author":"H Zhang","year":"2011","unstructured":"Zhang, H., Sadasivam, S.: Improved floor-planning of graphs via adjacency-preserving transformations. J. Comb. Optim. 22, 726\u2013746 (2011)","journal-title":"J. Comb. Optim."},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.aei.2012.01.002","volume":"26","author":"F Regateiro","year":"2012","unstructured":"Regateiro, F., Bento, J., Dias, J.: Floor plan design using block algebra and constraint satisfaction. Adv. Eng. Inf. 26, 361\u2013382 (2012)","journal-title":"Adv. Eng. Inf."},{"issue":"3","key":"1_CR22","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.foar.2013.12.003","volume":"3","author":"K Shekhawat","year":"2014","unstructured":"Shekhawat, K.: Algorithm for constructing an optimally connected rectangular floor plan. Front. Archit. Res. 3(3), 324\u2013330 (2014)","journal-title":"Front. Archit. Res."},{"key":"1_CR23","first-page":"395","volume":"724","author":"K Shekhawat","year":"2017","unstructured":"Shekhawat, K., Duarte, J.P.: Rectilinear floor plans. Commun. Comput. Inf. Sci. 724, 395\u2013411 (2017)","journal-title":"Commun. Comput. Inf. Sci."},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.cad.2017.09.004","volume":"95","author":"G Slusarczyk","year":"2018","unstructured":"Slusarczyk, G.: Graph-based representation of design properties in creating building floorplans. Comput. Aid. Des. 95, 24\u201339 (2018)","journal-title":"Comput. Aid. Des."},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.autcon.2018.03.037","volume":"92","author":"K Shekhawat","year":"2018","unstructured":"Shekhawat, K.: Enumerating generic rectangular floor plans. Autom. Constr. 92, 151\u2013165 (2018)","journal-title":"Autom. Constr."},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"1218","DOI":"10.1137\/0222072","volume":"22","author":"X He","year":"1993","unstructured":"He, X.: On finding the rectangular duals of planar triangular graphs. SIAM J. Comput. 22, 1218\u20131226 (1993)","journal-title":"SIAM J. Comput."},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-319-44989-0_27","volume-title":"Design Computing and Cognition \u201916","author":"K Shekhawat","year":"2017","unstructured":"Shekhawat, K., Duarte, J.P.: Automated best connected rectangular floorplans. In: Gero, J.S. (ed.) Design Computing and Cognition \u201916, pp. 495\u2013511. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-44989-0_27"},{"issue":"2","key":"1_CR28","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1017\/S1359135506000200","volume":"10","author":"P Steadman","year":"2006","unstructured":"Steadman, P.: Why are most buildings rectangular? ARQ Mag. 10(2), 119\u2013130 (2006)","journal-title":"ARQ Mag."}],"container-title":["Communications in Computer and Information Science","Computer-Aided Architectural Design. \"Hello, Culture\""],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-8410-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T19:05:07Z","timestamp":1560366307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-8410-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9789811384097","9789811384103"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-8410-3_1","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAAD Futures","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer-Aided Architectural Design Futures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Daejeon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caad-futures2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/caadfutures2019.kaist.ac.kr","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"194","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"18% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}