Shape Computation Lab

Sort Machines

 


Title:

Sort Machines

Authors:

Thomas Grasl and Athanassios Economou

Editors:

Stefan Müller Arisona, Gideon Aschwanden, Jan Halatsch, and Peter Wonka

Book:

Digital Urban Modelling and Simulation

Series:

Communications in Computer and Information Science (CCIS)

Issue:

242

Pages:

123-143

Publisher:

Springer-Verlag

Publication date:

2012

DOI:

0.1007/978-3-642-29758-8_7

Keywords:

Graph grammars, Generative building typologies, Courthouse typology, Polya’s theorem of counting

Abstract:

A graph grammar for the generation of topologies for the U.S. federal courthouse typology is introduced. The goal is to test and implement potential modelling techniques to account for a constructive description of courtroom organizations. The work reports on a specific graph-theoretic model that can generate and enumerate all possible topologies for the courtroom organization typology given a specific methodological framework. The model includes: a) an initial graph representing an ensemble of two or three zones grouped around one, two or more courtrooms; b) a graph theoretic rule-set covering all legal combinations and modifications of the initial basic element; c) a rewriting process to apply a variable number of rules and generate rudimentary descriptions of possible courthouse designs in terms of accessibility graphs; and d) an expansion of the nodes of the graphs into detailed spatial descriptions. A catalogue of possible configurations and a nomenclature for these configurations is given in the end.

links