Algorithmic complexity of shape grammar implementation. Issue 2 (9th May 2018)

• Record Type: Journal Article
• Authors: Wortmann, Thomas; Stouffs, Rudi
• Editors: Eloy, Sara; Pauwels, Pieter; Economou, Athanassios
• Is Part Of: AI EDAM. Volume 32:Issue 2(2018)
• Page Start: 138
• Page End: 146
• Publication Date: 2018-05-09
• Subjects: Shape grammars, -- shape grammar implementations, -- algorithmic complexity, -- tractability; Engineering design -- Data processing -- Periodicals; Artificial intelligence -- Periodicals; Expert systems (Computer science) -- Periodicals; 620.00420285
• DOI: 10.1017/S0890060417000440
• Languages: English
• ISSNs: 0890-0604

Abstract

Abstract: Computer-based shape grammar implementations aim to support creative design exploration by automating rule-application. This paper reviews existing shape grammar implementations in terms of their algorithmic complexity, extends the definition of shape grammars with sets of transformations for rule application, categorizes (parametric and non-parametric) sets of transformations, and analyses these categories in terms of the resulting algorithmic complexity. Specifically, it describes how different sets of transformations admit different numbers of targets (i.e., potential inputs) for rule application. In the non-parametric case, this number is quadratic or cubic, while in the parametric case, it can be non-polynomial, depending on the size of the target shape. The analysis thus yields lower bounds for the algorithmic complexity of shape grammar implementations that hold independently of the employed algorithm or data structure. Based on these bounds, we propose novel matching algorithms for non-parametric and parametric shape grammar implementation and analyze their complexity. The results provide guidance for future, general-purpose shape grammar implementations for design exploration.