This note discusses a relationship between planning requirements which simultaneously demand that rooms satisfy some set of adjacencies and that all rooms overlook the surroundings. It is shown that if, and only if, the adjacency graph contains nonouterplanar subgraphs K4 or K2,3 (or homeomorphic graphs to these with five or more vertices), no plan can be found to satisfy both requirements. If and only if the adjacency graph is outerplanar may all rooms have windows overlooking the surroundings. The connection between Kuratowski's planarity conditions and the tests for outerplanarity are demonstrated.
Get full access to this article
View all access options for this article.
References
1.
HararyF, 1969Graph Theory (Addison-Wesley, Reading, Mass).
2.
JayP A, 1974“Office lighting”The Architects' Journal159235–241.
3.
LevinP H, 1964“The use of graphs to decide the optimum layout of buildings”The Architects' Journal140809–815.
4.
MarchL, 1972“Elementary models of built form” in Urban Space and Structures Eds MartinLMarchL (Cambridge University Press, London).
5.
MarchLSteadmanP, 1971The Geometry of Environment (RIBA Publications, London).
6.
SteadmanP, 1973“Graph-theoretic representation of architectural arrangement”Architectural Research and Teaching2161–172.
