DSpace Repository

Construction of architectural floor plans for given adjacency requirements

Show simple item record

dc.contributor.author Shekhawat, Krishnendra
dc.date.accessioned 2023-08-10T10:27:11Z
dc.date.available 2023-08-10T10:27:11Z
dc.date.issued 2020
dc.identifier.uri https://papers.cumincad.org/data/works/att/caadria2020_068.pdf
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11298
dc.description.abstract For most of the architectural design problems, there are underlying mathematical sub-problems, they may require to consider for generating architectural layouts. One of these sub-problems is to satisfy adjacency constraints for obtaining an initial layout. But in the literature, there does not exist a mathematical procedure that can address any given adjacency requirements, i.e., there does not exist a tool for generating a floor plan corresponding to any given adjacency (planar) graph (there exist algorithms for constructing floor plans for planar triangulated graphs only). In this paper, we are going to present an algorithm that would generate a floor plan corresponding to any given planar graph. The larger aim of this research is to develop a user-friendly tool that can generate a variety of initial layouts corresponding to a given graph, which can be further modified by the architects/designers. en_US
dc.language.iso en en_US
dc.publisher CAADRIA en_US
dc.subject Mathematics en_US
dc.subject Floor plan en_US
dc.subject Algorithm en_US
dc.subject Graph Theory en_US
dc.title Construction of architectural floor plans for given adjacency requirements 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