Copy the page URI to the clipboard
Jowers, Iestyn; Earl, Chris and Stiny, George
(2019).
DOI: https://doi.org/10.1016/j.cad.2019.02.001
Abstract
Shape grammars are a generative formalism in which dynamic changes to shape structure plays a vital role. Such changes support ambiguity and emergence, and as a result shape grammars are often used as the basis for proposed developments in supporting shape exploration in computer-aided design. However, the general implementation of shape grammars remains an unsolved problem, and a common solution is to adopt a fixed structure. This paper explores the consequences of assuming a fixed structure, via analysis of a simple shape grammar, often used as a benchmark problem to illustrate advances in shape grammar implementation. With reference to the combinatorics of words, it is proved that adopting a finite fixed structure limits the capability of a shape grammar. The paper concludes with a discussion exploring the implication of this result for shape grammar implementation and for design descriptions in CAD.
Viewing alternatives
Download history
Metrics
Public Attention
Altmetrics from AltmetricNumber of Citations
Citations from DimensionsItem Actions
Export
About
- Item ORO ID
- 59348
- Item Type
- Journal Item
- ISSN
- 0010-4485
- Keywords
- shape structure; shape grammar implementation; combinatorics; computer-aided design
- Academic Unit or School
-
Faculty of Science, Technology, Engineering and Mathematics (STEM) > Engineering and Innovation
Faculty of Science, Technology, Engineering and Mathematics (STEM) - Depositing User
- ORO Import