id |
cf2007_251 |
authors |
Grasl, Thomas; Athanassios Economou |
year |
2007 |
title |
Spatial Similarity Metrics: Graph theoretic distance measurement and floor plan abstraction |
source |
Computer Aided Architectural Design Futures / 978-1-4020-6527-9 2007 [Proceedings of the 12th International Conference on Computer Aided Architectural Design Futures / 978-1-4020-6527-9] Sydney (Australia) 11–13 July 2007, pp. 251-263 |
summary |
Comparing space allocation programs computationally is a resource intensive task. This paper introduces a method which reduces the complexity of floor plan graphs to facilitate the problem. In a first step the nodes are labeled according to a laid out classification scheme. This in its own right reduces the complexity of the comparison by introducing more diversity among the nodes. Subsequently the graph can be coarsened in several steps based on the category information. This does not only further reduce the necessary computation, but can also offer a visualization of and additional insight into the essential structure of the space allocation program at hand. |
series |
CAAD Futures |
email |
|
full text |
file.pdf (611,957 bytes) |
references |
Content-type: text/plain
|
Administrative Office of the U.S. Courts (1997)
U.S. Courts Design Guide
,
|
|
|
|
Bunke, H and Allermann, G (1983)
Inexact graph matching for structural pattern recognition
, Pattern Recognition Letters 1(4): 245-253
|
|
|
|
Conroy, R and Kirsan, C (2005)
Graph Isomorphism and Genotypical Houses
, A van Nes (ed) Proceedings of the 5th Space Syntax Symposium Vol. 2, Techne Press, Delft, pp. 15-28
|
|
|
|
de Berg, M, van Kreveld, M, Overmars, M and Schwarzkopf, O (2000)
Computational Geometry. Algorithms and Applications
, Springer, Berlin
|
|
|
|
Dechter, R and Pearl, J (1985)
Generalized best-first search strategies and the optimality of A*
, Journal of the ACM 32(3): 505-536
|
|
|
|
Hillier, B, Hanson, J and Peponis, J (1984)
What do we mean by building function?
, J Powell and I Cooper (eds), Designing for building utilization, Spon, London, pp. 61-72
|
|
|
|
Karypis, G and Kumar, V (1995)
Analysis of Multilevel Graph Partitioning
, Proceedings of the IEEE/ACM SC95 Conference, p. 29
|
|
|
|
March, L and Steadman, P (1974)
The Geometry of Environment: An Introduction to Spatial Organization in Design
, The MIT Press, Cambridge
|
|
|
|
Neuhaus, M and Bunke, H (2004)
An Error-Tolerant Approximate Matching Algorithm for Attributed Planar Graphs and Its Application to Fingerprint Classification
, A Fred, T Caelli, RPW Duin, A Campilho, and D de Ridder (eds), Structural, Syntactic, and Statistical Pattern Recognition, Proc. Joint IAPR Int. Workshops SSPR and SPR, Springer, Berlin, pp. 180–189
|
|
|
|
Steadman, P (1976)
Graph-theoretic representation of architectural arrangement
, L March (eds), The Architecture of Form, Cambridge University Press, Cambridge, pp. 94-115
|
|
|
|
Stiny, G and Mitchell, W (1978)
The Palladian Grammar
, Environment and Planning B: Planning and Design 5: 5-18
|
|
|
|
last changed |
2007/07/06 12:47 |
|