Evaluation of a 3D Shape Grammar Implementation

Chau, Hau Hing; Chen, Xiaojuan; McKay, Alison; Pennington, Alan de

doi:10.1007/978-1-4020-2393-4_19

Cited by 70 publications

(66 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Such a platform fundamentally changes the past discrete structure of the research of implementing a shape grammar interpreter (Chau et al, 2004); duplicated work is significantly reduced, and the scope of the users, greatly expanded.…”

Section: An Approach To Practical Grammar Interpretersmentioning

confidence: 99%

“…It turns out that shape grammars that capture building style happens to be good choice. Of all the shape grammar applications reviewed by Chau et al (2004), about half deal with architectural plans. Moreover, conventional buildings, namely, buildings with rectangular spaces or dominated by such spaces, are often the subject matter.…”

Section: Three Exemplar Sub-frameworkmentioning

confidence: 99%

See 1 more Smart Citation

A Paradigm for Interpreting Tractable Shape Grammars

Yue

Krishnamurti

2014

Environ Plann B Plann Des

View full text Add to dashboard Cite

Shape grammars are, in general, intractable. Even amongst tractable shape grammars, their characteristics vary significantly. This paper describes a paradigm for practical general shape grammar interpreters, which aim to address computational difficulties posed by parameterization. The paradigm is expressed in terms of frameworks each comprising an underlying data structure, manipulation algorithms and a metalanguage. The approach is illustrated through three exemplar frameworks.

show abstract

Section: An Approach To Practical Grammar Interpretersmentioning

confidence: 99%

Section: Three Exemplar Sub-frameworkmentioning

confidence: 99%

A Paradigm for Interpreting Tractable Shape Grammars

Yue

Krishnamurti

2014

Environ Plann B Plann Des

View full text Add to dashboard Cite

show abstract

“…Implementing a parametric shape grammar interpreter has long been considered difficult (Chau et al, 2004;Gips, 1999), for reasons not always apparent. In this paper we consider the issue of implementation through a formal examination of tractability of the shape grammar formalism for which we invoke both formal language theory and asymptotic analyses of algorithms.…”

Section: Introductionmentioning

confidence: 99%

Tractable Shape Grammars

Yue

Krishnamurti

2013

Environ Plann B Plann Des

View full text Add to dashboard Cite

This paper explores the theoretical basis for a concept of "computation-friendly" shape grammars, through a formal examination of tractability of the grammar formalism.Although a variety of shape grammar definitions have evolved over time, it is possible to unify these to be backwards compatible. Under this unified definition, a shape grammar can be constructed to simulate any Turing machine from which it follows that: a shape grammar may not halt; its language space can be exponentially large; and in general, its membership problem is unsolvable. Moreover, parametric subshape recognition is shown to be NP. This implies that it is unlikely in general to find a polynomial time algorithm to interpret parametric shape grammars, and that more pragmatic approaches need to be sought. Factors that influence the tractability of shape grammars are identified and discussed.

show abstract

“…A generative design system is basically structured around a graphical user interface with which the user can modify and evaluate product forms, and an interactive optimization system or an interactive constraint satisfaction system that handles user and technical preferences and constraints. Most generative design systems have been intended for professional designers, for example to help the designer preserve the "form" identity of a brand [2][3][4][5]. Only a few have been developed for consumers, e.g.…”

mentioning

confidence: 99%