From topologies to shapes
Parametric shape grammars implemented by graphs
A method for implementing parametric shape grammars is presented. Subgraph detection is used to find subshapes. Parametric shapes are described by restricting topologies.
Difficulties in communicating shape grammar rules to a digital interpreter
The rule editor of a parametric shape grammar interpreter is presented. The problems that arise are discussed along with their solutions.
On Shapes and Topologies
Graph theoretic representations of shapes and shape computations
Shape grammars are an established method in the field of design computation. Since their initial formulation in the 70s the underlying theory has been developed intensively. Applications have mostly been restricted to showcase grammars remodelling existing bodies of work. Difficulties in automating shape grammars have restricted their extramural impact. This thesis attempts to remedy the […]
A graph grammar for the generation of topologies for the U.S. federal courthouse typology is introduced. Possible configurations are enumerated and a nomenclature is proposed.
GRAPPA, an implementation of the Palladian grammar, is introduced. Graphs are used for the underlying representation, graph grammars take over the computation. Once a set of graph grammar rules equivalent to the original set of shape rules is defined, derivations, in the form of attributed graphs, are generated. These graphs contain all necessary information to […]
A parametric shape grammar implementation
An implementation of a shape grammar interpreter is described. The underlying graph-theoretic framework is briefly discussed to show how alternative representations from graph theory including graphs, overcomplete graphs and hyperedge graphs can support some of the intuitions handled in shape grammars by direct visual computations with shapes. The resulting plugin implemented in Rhino, code-named GRAPE, […]
An automated implementation of the Palladian grammar
An implementation of the Palladian grammar using a graph grammar and a graph to shape mapping is presented. The application is embedded in a parametric CAD environment and allows the exploration of Palladian villas by hand or by using a random generator.
Xenakis’ sieves are a powerful formal tool to create integer-sequence generators that can be used for the generation of various numerical patterns to represent pitch scales, rhythm sequences, as well as patterns of loudness, density, timber and so forth. The key idea in the design of the sieves is the notion of a vocabulary of […]
Using a Graph Grammar to Generate Courthouse Topologies
A graph grammar for the generation of topologies for the u.s. federal courthouse typology is introduced. Possible configurations are enumerated and a nomenclature is proposed. Embedded within a larger project on the analysis and generative description of u.s. federal courthouses, the aim of this task was to enumerate, generate and name possible topologies for the courthouses […]
A computational approach for the automated graph representation and diagrammatic notation of all underlying symmetry structures of three-dimensional shapes with a center of symmetry is briefly presented and some applications with shape grammars to illustrate these ideas are discussed in the end. CUMINCAD