A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
The combinatorial complexity of most floor plan design problems makes it practically impossible to obtain a systematic knowledge of possible solutions using pencil and paper. The objective of this paper is to contribute to the development of computer methods providing such knowledge for the designer. The author describes an algorithm which generates all possible rectangular plans on modular grids with congruent cells, subject to constraints on total area, room areas, wall lengths, room adjacencies, and room orientations. To make room sizes regular and limit the solution set only such grids are used which minimize the number of cells in the smallest room. The description is sufficiently detailed to serve as a basis for programming. Test results for a Pascal implementation of the algorithm are reported. Realistic problems of up to ten rooms have been solved in modest lengths of computer time. The results indicate that the approach of exhaustive generation may prove to be more fruitful than generally assumed.
The combinatorial complexity of most floor plan design problems makes it practically impossible to obtain a systematic knowledge of possible solutions using pencil and paper. The objective of this paper is to contribute to the development of computer methods providing such knowledge for the designer. The author describes an algorithm which generates all possible rectangular plans on modular grids with congruent cells, subject to constraints on total area, room areas, wall lengths, room adjacencies, and room orientations. To make room sizes regular and limit the solution set only such grids are used which minimize the number of cells in the smallest room. The description is sufficiently detailed to serve as a basis for programming. Test results for a Pascal implementation of the algorithm are reported. Realistic problems of up to ten rooms have been solved in modest lengths of computer time. The results indicate that the approach of exhaustive generation may prove to be more fruitful than generally assumed.
An algorithm for exhaustive generation of building floor plans
Ein Algorithmus zur Generierung von kompletten Gebaeudeflaechenplaenen
Galle, P. (author)
Communications of the ACM ; 24 ; 813-825
1981
13 Seiten, 46 Quellen
Article (Journal)
English
A Novel Algorithm for Real-time Procedural Generation of Building Floor Plans
| ArXiv | 2012
Floor Plans and Building Image
| Springer Verlag | 2016
| DataCite | 2016
A Graph Theoretical Approach for Creating Building Floor Plans
| British Library Conference Proceedings | 2019