Carnegie Mellon University
Browse

Developing a tractable shape grammar

Download (1.76 MB)
journal contribution
posted on 2014-06-01, 00:00 authored by Kui Yue, Ramesh KrishnamurtiRamesh Krishnamurti

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.

History

Publisher Statement

The final publication is available at Sage via http://dx.doi.org/10.1068/b120046p

Date

2014-06-01

Usage metrics

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC