Developing a tractable shape grammar

Ramesh Krishnamurti and Kui Yue

Environment and Planning B, 2015, vol. 42, issue 6, 977-1002

Abstract: Previously, we examined tractable parametric shape grammars and developed a general paradigm for implementing classes of such grammars. A tractable shape grammar has polynomial computing complexity, and is specified in a way that is readily transformable to a computer program. By contrast, traditionally, shape grammars have been typically developed without a computer implementation in mind, either requiring ambiguity to be clarified, or it is hardly possible for the grammar to be implemented by a polynomial algorithm. Each tractable shape grammar is tied to a particular framework, which is backed by a data structure and supports a metalanguage. In this paper we illustrate the development of tractable shape grammars by transforming a shape grammar developed, essentially, in traditional fashion for the Baltimore rowhouse. The development is for a specific application context— to determine the interior layout of a building given its external features—and the process serves as a general strategy for developing tractable shape grammars.

Keywords: shape grammars; implementation; Baltimore rowhouse (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1177/0265813515610673 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:envirb:v:42:y:2015:i:6:p:977-1002

DOI: 10.1177/0265813515610673

Access Statistics for this article

More articles in Environment and Planning B
Bibliographic data for series maintained by SAGE Publications ().