Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/11282Full metadata record
| DC Field | Value | Language |
|---|---|---|
| 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 |
| 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.