Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/11302Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Shekhawat, Krishnendra | - |
| dc.date.accessioned | 2023-08-10T10:39:32Z | - |
| dc.date.available | 2023-08-10T10:39:32Z | - |
| dc.date.issued | 2022-02 | - |
| dc.identifier.uri | https://link.springer.com/chapter/10.1007/978-3-030-90625-2_14 | - |
| dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11302 | - |
| 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 |
| dc.language.iso | en | en_US |
| dc.publisher | Springer | en_US |
| dc.subject | Mathematics | en_US |
| dc.subject | Floor plan | en_US |
| dc.title | A Mathematical Approach for Generating a Floor Plan for Given Adjacency Requirements | en_US |
| dc.type | Book chapter | en_US |
| Appears in Collections: | Department of Mathematics | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.