DSpace Repository

Enumerating generic rectangular floor plans

Show simple item record

dc.contributor.author Shekhawat, Krishnendra
dc.date.accessioned 2023-08-10T09:13:24Z
dc.date.available 2023-08-10T09:13:24Z
dc.date.issued 2018-08
dc.identifier.uri https://www.sciencedirect.com/science/article/pii/S0926580517310191
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11282
dc.description.abstract A rectangular floor plan (RFP) is a floor plan in which plan's boundary and each room is a rectangle. The problem is to construct a RFP for the given adjacency requirements, if it exists. In this paper, we aim to present a generic solution to the above problem by enumerating a set of RFP that topologically contain all possible RFP. This set of RFP is called generic rectangular floor plans (GRFP). Furthermore, the construction of GRFP leads us to the necessary condition for the existence of a RFP corresponding to a given graph. en_US
dc.language.iso en en_US
dc.publisher Elsevier en_US
dc.subject Mathematics en_US
dc.subject Adjacency en_US
dc.subject Architectural design en_US
dc.subject Dual graph en_US
dc.subject Graph Theory en_US
dc.subject Algorithm en_US
dc.subject Floor plan en_US
dc.title Enumerating generic rectangular floor plans 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