Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/11275
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Shekhawat, Krishnendra | - |
dc.date.accessioned | 2023-08-10T08:40:09Z | - |
dc.date.available | 2023-08-10T08:40:09Z | - |
dc.date.issued | 2023 | - |
dc.identifier.uri | https://arxiv.org/pdf/1910.00081 | - |
dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11275 | - |
dc.description.abstract | This paper proposes a methodology for the automated construction of rectangular floorplans (RFPs) while addressing dimensional constraints and adjacency relations. Here, adjacency relations are taken in the form of a dimensionless rectangular arrangement (RA) ensuring the existence of a RFP, while dimensional constraints are given in terms of minimum width and aspect ratio range for each room. A linear optimization model is then presented to obtain a feasible dimensioned RFP for user-defined constraints. A GUI is also developed for the automated generation of RFPs. The proposed model is able to generate feasible solutions for every possible RA in a reasonable amount of time. From the architectural prospective, this work can be seen as a re-generation of well-known architectural plans with modified dimensions. At the end, the regeneration of existing legacy RFPs (corresponding to the user defined dimensions) has been demonstrated, taking their image as input. | en_US |
dc.language.iso | en | en_US |
dc.publisher | ARXIV | en_US |
dc.subject | Mathematics | en_US |
dc.subject | Floorplanning | en_US |
dc.subject | Rectangular Floorplan | en_US |
dc.subject | Network Flow | en_US |
dc.subject | Graph Theory | en_US |
dc.title | Automated Generation of Dimensioned Rectangular Floorplans | en_US |
dc.type | Article | 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.