DSpace Repository

Algorithm for constructing an optimally connected rectangular floor plan

Show simple item record

dc.contributor.author Shekhawat, Krishnendra
dc.date.accessioned 2023-08-10T10:37:17Z
dc.date.available 2023-08-10T10:37:17Z
dc.date.issued 2014-09
dc.identifier.uri https://www.sciencedirect.com/science/article/pii/S2095263514000375
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11301
dc.description.abstract In 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.iso en en_US
dc.publisher Elsevier en_US
dc.subject Mathematics en_US
dc.subject Floor plan en_US
dc.subject Extra space en_US
dc.subject Algorithm en_US
dc.subject Adjacency en_US
dc.title Algorithm for constructing an optimally connected rectangular floor plan en_US
dc.type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account