Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-29T15:17:03.812Z Has data issue: false hasContentIssue false
  • English
  • Français

Introduction to generic rectangular floor plans

Published online by Cambridge University Press:  30 May 2018

Krishnendra Shekhawat Open the ORCID record for Krishnendra Shekhawat [Opens in a new window]  and
José P. Duarte
Krishnendra Shekhawat*
Affiliation:
BITS, Pilani Department of Mathematics, Pilani Campus, India
José P. Duarte
Affiliation:
SCDC, School of Architecture and Landscape Architecture, The Pennsylvania State University, USA
*
Author for correspondence: Krishnendra Shekhawat, E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

An important task in the initial stages of most architectural design processes is the design of planar floor plans, that are composed of non-overlapping rooms divided from each other by walls while satisfying given topological and dimensional constraints. The work described in this paper is part of a larger research aimed at developing the mathematical theory for examining the feasibility of given topological constraints and providing a generic floor plan solution for all possible design briefs.

In this paper, we mathematically describe universal (or generic) rectangular floor plans with n rooms, that is, the floor plans that topologically contain all possible rectangular floor plans with n rooms. Then, we present a graph-theoretical approach for enumerating generic rectangular floor plans upto nine rooms. At the end, we demonstrate the transformation of generic floor plans into a floor plan corresponding to a given graph.

Keywords

Adjacencyarchitectural designdegree sequencegraphtheory rectangular dual
Type
Research Article
Information
AI EDAM , Volume 32 , Issue 3 , August 2018 , pp. 331 - 350
Copyright
Copyright © Cambridge University Press 2018 

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.)

References

Baybars, I and Eastman, CM (1980) Enumerating architectural arrangements by generating their underlying graphs. Environment and Planning B 7, 289–310.Google 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(3), 307–317.Google Scholar
Combes, L (1976) Packing rectangles into rectangular arrangements. Environment and Planning B 3, 3–32.Google Scholar
Cousin, J (1970) Topological organization of architectural spaces. Architectural Design 140(15), 491–493.Google Scholar
Del Rio-Cidoncha, G, Martinez-Palacios, J and Iglesias, JE (2007) A multidisciplinary model for floorplan design. International Journal of Production Research 45(15), 3457–3476.Google Scholar
Earl, CF and March, LJ (1979) Architectural applications of graph theory. In Wilson, RJ, Beineke, LW (eds). Applications of Graph Theory. London: Academic Press, pp. 327–355.Google Scholar
Grason, J (1970) A dual linear representation for space filling location problems of the floorplan type. In Moore, GT (ed). Emerging Methods of Environmental Design and Planning. Cambridge, Mass: MIT Press, pp. 170–178.Google Scholar
Ham, S and Lee, G (2017) Time-Based joining method for generating phylogenetic trees of architectural plans. Journal of Computing in Civil Engineering 31(2), 04016055.CrossRefGoogle Scholar
Jokar, MRA and Sangchooli, AS (2011) Constructing a block layout by face area. International Journal of Manufacturing Technology 54, 801–809.Google Scholar
Koźmiński, K and Kinnen, E (1985) Rectangular dual of planar graphs. Networks 5, 145–157.Google Scholar
Kuratowski, C (1930) Sur le problème des courbes gauches en topologie, Fundamenta Mathematicae (in French) 15(1), 271–283.Google Scholar
Levin, PH (1964) Use of graphs to decide the optimum layout of buildings. The Architects 140(15), 809–817.Google Scholar
March, LJ and Earl, CF (1977) On counting architectural plans. Environment and Planning B 4, 57–80.Google 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, Article ID 624817.Google Scholar
Radcliffe, PE, Kawal, DE and Stephenson, RJ (1967) Critical Path Method. Chicago, IL: Cahner.Google Scholar
Recuero, A, Rio, O and Alvarez, M (2000) Heuristic method to check the realisability of a graph into a rectangular plan. Advances in Engineering Software 31, 223–231.Google Scholar
Rinsma, I (1987) Nonexistence of a certain rectangular floorplan with specified areas and adjacency. Environment and Planning B: Planning and Design 14, 163–166.Google Scholar
Rinsma, I (1988) Rectangular and orthogonal floorplans with required room areas and tree adjacency. Environment and Planning B: Planning and Design 15, 111–118.Google Scholar
Robinson, DF and Janjic, I (1985) The constructability of floorplans with certain given outerplanar adjacency graph and room areas, Proceedings Xth British Combinatorics Conference, Ars Combinatoria 20B. Cambridge: Cambridge University Press, pp. 133–142.Google Scholar
Roth, J, Hashimshony, R and Wachman, A (1982) Turning a graph into a rectangular floor plan. Building and Environment 17(3), 163–173.Google Scholar
Roth, J and Wachman, A (1978) A Model for Optimal Compact Packing of Convex Cells in an Orthogonal Network. Haifa: Technion-I.I.T., Faculty of Architecture and Town Planning.Google Scholar
Sauda, EJ (1975) Computer Program for the Generation of Dwelling Unit Floor Plans, MArch thesis, University of California, Los Angeles.Google Scholar
Schwarz, A, Berry, DM and Shaviv, E (1994) On the use of the automated building design system. Computer-Aided Design 26(10), 747–762.Google Scholar
Shekhawat, K (2014) Algorithm for constructing an optimally connected rectangular floor plan. Frontiers of Architectural Research 3(3), 324–330.CrossRefGoogle Scholar
Shekhawat, K and Duarte, JP (2017) Automated best connected rectangular floorplans. In Gero, J (ed). Design Computing and Cognition ‘16. Cham, Switzerland: Springer International Publishing, pp. 495–511.Google Scholar
Steadman, JP (1973) Graph theoretic representation of architectural arrangement. Architectural Research and Teaching 2/3, 161–172.Google Scholar
Steadman, JP (1983) Architectural Morphology: An Introduction to the Geometry of Building Plans. UK: Pion Press.Google Scholar
Steadman, P (2006) Why are most buildings rectangular? Arq magazine 10(2), 119–130.Google Scholar
Stiny, G (1980) Introduction to shape and shape grammars. Environment and Planning B 7, 343–351.Google Scholar