DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/17433
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShekhawat, Krishnendra-
dc.date.accessioned2025-02-10T09:06:08Z-
dc.date.available2025-02-10T09:06:08Z-
dc.date.issued2023-05-
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S1524070323000061-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/17433-
dc.description.abstractExisting 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.isoenen_US
dc.publisherElsevieren_US
dc.subjectMathematicsen_US
dc.subjectAlgorithmen_US
dc.subjectAdjacencyen_US
dc.subjectFloorplanen_US
dc.subjectGraph theoryen_US
dc.titleAutomated generation of floorplans with non-rectangular roomsen_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.