Skip to main content
×
×
Home

Introduction to generic rectangular floor plans

  • Krishnendra Shekhawat (a1) and José P. Duarte (a2)
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.

Copyright
Corresponding author
Author for correspondence: Krishnendra Shekhawat, E-mail: krishnendra.iitd@gmail.com
References
Hide All
Baybars, I and Eastman, CM (1980) Enumerating architectural arrangements by generating their underlying graphs. Environment and Planning B 7, 289310.
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), 307317.
Combes, L (1976) Packing rectangles into rectangular arrangements. Environment and Planning B 3, 332.
Cousin, J (1970) Topological organization of architectural spaces. Architectural Design 140(15), 491493.
Del Rio-Cidoncha, G, Martinez-Palacios, J and Iglesias, JE (2007) A multidisciplinary model for floorplan design. International Journal of Production Research 45(15), 34573476.
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. 327355.
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. 170178.
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.
Jokar, MRA and Sangchooli, AS (2011) Constructing a block layout by face area. International Journal of Manufacturing Technology 54, 801809.
Koźmiński, K and Kinnen, E (1985) Rectangular dual of planar graphs. Networks 5, 145157.
Kuratowski, C (1930) Sur le problème des courbes gauches en topologie, Fundamenta Mathematicae (in French) 15(1), 271283.
Levin, PH (1964) Use of graphs to decide the optimum layout of buildings. The Architects 140(15), 809817.
March, LJ and Earl, CF (1977) On counting architectural plans. Environment and Planning B 4, 5780.
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.
Radcliffe, PE, Kawal, DE and Stephenson, RJ (1967) Critical Path Method. Chicago, IL: Cahner.
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, 223231.
Rinsma, I (1987) Nonexistence of a certain rectangular floorplan with specified areas and adjacency. Environment and Planning B: Planning and Design 14, 163166.
Rinsma, I (1988) Rectangular and orthogonal floorplans with required room areas and tree adjacency. Environment and Planning B: Planning and Design 15, 111118.
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. 133142.
Roth, J, Hashimshony, R and Wachman, A (1982) Turning a graph into a rectangular floor plan. Building and Environment 17(3), 163173.
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.
Sauda, EJ (1975) Computer Program for the Generation of Dwelling Unit Floor Plans, MArch thesis, University of California, Los Angeles.
Schwarz, A, Berry, DM and Shaviv, E (1994) On the use of the automated building design system. Computer-Aided Design 26(10), 747762.
Shekhawat, K (2014) Algorithm for constructing an optimally connected rectangular floor plan. Frontiers of Architectural Research 3(3), 324330.
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. 495511.
Steadman, JP (1973) Graph theoretic representation of architectural arrangement. Architectural Research and Teaching 2/3, 161172.
Steadman, JP (1983) Architectural Morphology: An Introduction to the Geometry of Building Plans. UK: Pion Press.
Steadman, P (2006) Why are most buildings rectangular? Arq magazine 10(2), 119130.
Stiny, G (1980) Introduction to shape and shape grammars. Environment and Planning B 7, 343351.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

AI EDAM
  • ISSN: 0890-0604
  • EISSN: 1469-1760
  • URL: /core/journals/ai-edam
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords

Metrics

Full text views

Total number of HTML views: 1
Total number of PDF views: 10 *
Loading metrics...

Abstract views

Total abstract views: 51 *
Loading metrics...

* Views captured on Cambridge Core between 30th May 2018 - 22nd July 2018. This data will be updated every 24 hours.