DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/11289
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShekhawat, Krishnendra-
dc.date.accessioned2023-08-10T09:35:07Z-
dc.date.available2023-08-10T09:35:07Z-
dc.date.issued2015-09-
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S2090447915000349-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11289-
dc.description.abstractThis 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.isoenen_US
dc.publisherElsevieren_US
dc.subjectMathematicsen_US
dc.subjectAdjacencyen_US
dc.subjectAlgorithmen_US
dc.subjectFloorplansen_US
dc.subjectGraph Shapeen_US
dc.subjectSpace allocationen_US
dc.titleAutomated space allocation using mathematical techniquesen_US
dc.typeArticleen_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.