| dc.description.abstract |
One of the preliminary steps in designing architectural floor plans is to build floor plans for a given adjacency graph. Here, we present a mathematical procedure for enumerating maximal rectangular floor plans that would address the following two purposes:
i. Provides a catalogue of maximal rectangular floor plans, which can be seen as a super set of all possible rectangular floor plans,
ii. Maximal rectangular floor plans can be used to generate floor plans for the adjacency requirements for which rectangular floor plans do not exist.
Hence, in this paper, we present an algorithmic approach for producing a floor plan corresponding to any adjacency requirements provided by the user/architect/designer. This work aims to build a computerized system to generate floor plans, i.e., we aspire to provide design tools to architects for generating feasible layouts that can be further adjusted or modified. |
en_US |