Nonexistence of a Certain Rectangular Floorplan with Specified Areas and Adjacency

I Rinsma
Additional contact information
I Rinsma: Mathematics Department, University of Canterbury, Christchurch 1, New Zealand

Environment and Planning B, 1987, vol. 14, issue 2, 163-166

Abstract: In facility layouts—the designing of floorplans with certain rooms adjacent to each other—there are often area constraints for the rooms. Robinson and Janjic showed that, if areas are specified for rooms with a given maximal outerplanar adjacency graph, then any convex polygon with the correct area can be divided into convex rooms to satisfy both area and adjacency requirements. If the perimeter and rooms must be rectangular, undimensioned floorplans can be found to fit any maximal outerplanar adjacency graph with at most four vertices of degree 2. It is shown that in some cases it is not always possible to satisfy the area constraints.

Date: 1987
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/b140163 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:envirb:v:14:y:1987:i:2:p:163-166

DOI: 10.1068/b140163

Access Statistics for this article

More articles in Environment and Planning B
Bibliographic data for series maintained by SAGE Publications ().