DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/11299
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShekhawat, Krishnendra-
dc.date.accessioned2023-08-10T10:30:12Z-
dc.date.available2023-08-10T10:30:12Z-
dc.date.issued2019-
dc.identifier.urihttps://pure.psu.edu/en/publications/a-graph-theoretical-approach-for-creating-building-floor-plans-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11299-
dc.description.abstractExisting floor planning algorithms are mostly limited to rectangular room geometries. This restriction is a significant reason why they are not used much in design practice. To address this issue, we propose an algorithm (based on graph theoretic tools) that generates rectangular and, if required, orthogonal floor plans while satisfying the given adjacency requirements. If a floor plan does not exist for the given adjacency requirements, we introduce circulations within a floor plan to have a required floor plan.en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.subjectMathematicsen_US
dc.subjectGraph Theoryen_US
dc.titleA Graph Theoretical Approach for Creating Building Floor Plansen_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.