[Back]


Talks and Poster Presentations (with Proceedings-Entry):

R. Schaffranek:
"Parallel planning - An experimental study in spectral graph matching";
Talk: Space Syntax Symposium 10, London; 07-13-2015 - 07-17-2015; in: "Proceedings of the 10th Space Syntax Symposium: Book of Abstracts", Space Syntax Laboratory, The Bartlett School of Architecture, UCL, (2015), ISBN: 978-0-9933429-0-5; 151:1 - 151:14.



English abstract:
A lot of attempts have been made in recent years to generate geometrically correct floor plans, spatial configurations and urban layouts in connection with functional relations and defined spatial properties(Elezkurtaj and Franck, 1999) (Duarte, 2001) (Donath, König and Petzold, 2012) (Nourian, Rezvani and Sariyildiz, 2013).Different heuristics (force based drawing...) / optimisations methods (metaheuristic solvers such as genetic algorithms, simulated annealing...)have been applied to search for the »best« trade of between a set of constraint/properties. Most of these techniques are based on an iterative and time-consuming process finding a good solution for one, two, maybe three different constraints/properties. But architecture is related to a multitude of different constraints/properties, which strongly depend on the given task and its context.
In image processing spectral graph matching has shown to solve different tasks such as graph drawing, image matching and image segmentation. A direct translation to architecture seems obvious as an image similar to a plan represents a particular spatial embedding of elements (pixels, rooms...) in two-dimensional space. As these problems are described through graphs, which represent the relation of elements rather than a particular spatial embedding, these approaches are applicable not only to a two-dimensional space but also in higher dimensions.
With such tools at hand, a prototype of a spatial configuration defined by a graph (functional or through properties such as e.g. integration, choice...) can be applied to an existing configuration (e.g. the refurbishment of existing buildings), to a spatial configuration which is generated by other properties than the prototype (e.g. structural, solar gain...) or to the most generic: A grid, resulting in a possible spatial embedding of the prototype. This allows to unlink functional / configuration lconstraint with other properties (an existing configuration, other configurational constraints/properties such as structural, solar...). Through unlinking, each constraint can be looked at on its own, developed on its own to a wanted solution and than relinked again. Further the process of matching two graphs, based on spectral graph theory, is not based on an iterative process but on one with a fixed computational time. Here the bottleneck is the calculation of the eigenvectors which can be preformed at least in O(n3).

Keywords:
enerative planning, spectral graph theory, graph drawing, graph matching, parallel planning.


Electronic version of the publication:
http://publik.tuwien.ac.at/files/PubDat_240018.pdf


Created from the Publication Database of the Vienna University of Technology.