DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/11301
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShekhawat, Krishnendra-
dc.date.accessioned2023-08-10T10:37:17Z-
dc.date.available2023-08-10T10:37:17Z-
dc.date.issued2014-09-
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S2095263514000375-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11301-
dc.description.abstractIn most applications, such as urbanism and architecture, randomly utilizing given spaces is certainly not favorable. This study proposes an explicit algorithm for utilizing the given spaces inside a rectangle with satisfactory results. In the literature, connectivity is not considered as a criterion for floor plan design, but it is deemed essential in architecture. For example, dining rooms are preferably connected to kitchens, toilets should be connected to many rooms, and each bedroom should be separated from the other rooms. This paper describes adjacency among spaces and proves that the obtained rectangular floor plan is one of the best ones in terms of connectivity. An architectural and mathematical object called extra spaces is introduced by the proposed algorithm and is subsequently examined in this work.en_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.subjectMathematicsen_US
dc.subjectFloor planen_US
dc.subjectExtra spaceen_US
dc.subjectAlgorithmen_US
dc.subjectAdjacencyen_US
dc.titleAlgorithm for constructing an optimally connected rectangular floor planen_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.