DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/11297
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShekhawat, Krishnendra-
dc.date.accessioned2023-08-10T10:23:59Z-
dc.date.available2023-08-10T10:23:59Z-
dc.date.issued2021-
dc.identifier.urihttps://papers.cumincad.org/data/works/att/caadria2021_099.pdf-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11297-
dc.description.abstractThe automated generation of architectural layouts is an intensively studied research area where the aim is to generate a variety of (initial) layouts for the given constraints which can be further modified by designers and architects. From a mathematical perspective, one of the well-known constraints is given in the form of an adjacency graph which represents the adjacency relations of the given rooms and problem is to generate multiple layouts satisfying the adjacency relations. In the literature, the adjacency graph is usually taken as a bi-connected planar triangular graph. In this paper, we present the results of a prototype GPLAN that generates multiple dimensioned layouts for any given planar graph. The larger aim of this work is to develop software that can produce a variety of architecturally acceptable floorplans corresponding to the given constraints.en_US
dc.language.isoenen_US
dc.publisherCAADRIAen_US
dc.subjectMathematicsen_US
dc.subjectGraph Theoryen_US
dc.subjectArchitectural layoutsen_US
dc.titleA Graph Theoretic Approach for the Automated Generation of Dimensioned Floorplansen_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.