DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/11300
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShekhawat, Krishnendra-
dc.date.accessioned2023-08-10T10:35:14Z-
dc.date.available2023-08-10T10:35:14Z-
dc.date.issued2017-
dc.identifier.urihttps://pure.psu.edu/en/publications/rectilinear-floor-plans-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11300-
dc.description.abstractThis work aims at providing a mathematical approach to the problem of allocating given rooms within a given predefined contour shape, while satisfying given adjacency and size constraints. This work is significant with respect to complex building structures, such as hospitals, schools, offices, etc., where we may require floor plans other than rectangular ones and adjacency constraints are defined by the frequency of journeys expected to be made by occupants of the building along different routes. In this paper, we present an algorithmic approach using graph theoretical tools for generating rectilinear floor plan layouts, while satisfying adjacency and size constraints.en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.subjectMathematicsen_US
dc.subjectRectilinearen_US
dc.titleRectilinear 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.