Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/11289
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Shekhawat, Krishnendra | - |
dc.date.accessioned | 2023-08-10T09:35:07Z | - |
dc.date.available | 2023-08-10T09:35:07Z | - |
dc.date.issued | 2015-09 | - |
dc.identifier.uri | https://www.sciencedirect.com/science/article/pii/S2090447915000349 | - |
dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11289 | - |
dc.description.abstract | This paper presents a systematic pathway for the floor plan design when given the shape of required floor plan, the list of spaces, the dimensions of each space and the weighted matrix of required adjacencies between the spaces. The first step is to partition the given shape into say k possible rectangles. Then using the given adjacencies, divide the given spaces into k groups. Next is to construct a rectangular block for each group and at last adjoin all rectangular blocks to have the required floor plan. The obtained rectangular blocks are one of the best arrangement of spaces inside a rectangle from the point of view of connectivity. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Elsevier | en_US |
dc.subject | Mathematics | en_US |
dc.subject | Adjacency | en_US |
dc.subject | Algorithm | en_US |
dc.subject | Floorplans | en_US |
dc.subject | Graph Shape | en_US |
dc.subject | Space allocation | en_US |
dc.title | Automated space allocation using mathematical techniques | 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.