DSpace Repository

Automated generation of floorplans with non-rectangular rooms

Show simple item record

dc.contributor.author Shekhawat, Krishnendra
dc.date.accessioned 2025-02-10T09:06:08Z
dc.date.available 2025-02-10T09:06:08Z
dc.date.issued 2023-05
dc.identifier.uri https://www.sciencedirect.com/science/article/pii/S1524070323000061
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/17433
dc.description.abstract Existing approaches (in particular graph theoretic) for generating floorplans focus on constructing floorplans for given adjacencies without considering boundary layout or room shapes. With recent developments in designs, it is demanding to consider multiple constraints while generating floorplan layouts. In this paper, we study graph theoretic properties which guarantee the presence of different shaped rooms within the floorplans. Further, we present a graph-algorithms based application, developed in Python, for generating floorplans with given input room shapes. The proposed application is useful in creating floorplans for a given graph with desired room shapes mainly, L, T, F, C, staircase, and plus-shape. Here, the floorplan boundary is always rectangular. In future,we aim to extend this work to generate any (rectilinear) room shape and floor plan boundary for a given graph. en_US
dc.language.iso en en_US
dc.publisher Elsevier en_US
dc.subject Mathematics en_US
dc.subject Algorithm en_US
dc.subject Adjacency en_US
dc.subject Floorplan en_US
dc.subject Graph theory en_US
dc.title Automated generation of floorplans with non-rectangular rooms 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