CumInCAD is a Cumulative Index about publications in Computer Aided Architectural Design
supported by the sibling associations ACADIA, CAADRIA, eCAADe, SIGraDi, ASCAAD and CAAD futures

authors Galle, Per
year 1981
title An Algorithm for Exhaustive Generation of Building Floor Plans
source Communications of the ACM December, 1981. vol. 2: pp.813-823, [3] : ill. includes bibliography.
summary 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 paper 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 up to ten rooms have been solved in modest length of computer time. The results indicate that the approach of exhaustive generation may prove to be more fruitful than generally assumed
keywords architecture, floor plans, automation, design, planning, algorithms, combinatorics, grids, constraints, synthesis
series CADline
references Content-type: text/plain
last changed 1999/02/12 14:08
HOMELOGIN (you are user _anon_342603 from group guest) Works Powered by SciX Open Publishing Services 1.002