DSpace logo

  1. BITS Pilani Institutional Repository
  2. BITS Faculty Publications
  3. Department of Mathematics
Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/11282
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShekhawat, Krishnendra-
dc.date.accessioned2023-08-10T09:13:24Z-
dc.date.available2023-08-10T09:13:24Z-
dc.date.issued2018-08-
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S0926580517310191-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11282-
dc.description.abstractA 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.isoenen_US
dc.publisherElsevieren_US
dc.subjectMathematicsen_US
dc.subjectAdjacencyen_US
dc.subjectArchitectural designen_US
dc.subjectDual graphen_US
dc.subjectGraph Theoryen_US
dc.subjectAlgorithmen_US
dc.subjectFloor planen_US
dc.titleEnumerating generic rectangular floor plansen_US
dc.typeArticleen_US
Appears in Collections:Department of Mathematics

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.