Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/11282| Title: | Enumerating generic rectangular floor plans |
| Authors: | Shekhawat, Krishnendra |
| Keywords: | Mathematics Adjacency Architectural design Dual graph Graph Theory Algorithm Floor plan |
| Issue Date: | Aug-2018 |
| Publisher: | Elsevier |
| 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. |
| URI: | https://www.sciencedirect.com/science/article/pii/S0926580517310191 http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11282 |
| 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.