Skip to main content
Article thumbnail
Location of Repository

Computation-friendly shape grammars: Detailed by a sub-framework over parametric 2D rectangular shapes

By K. Yue, R. Krishnamurti and F. Grobler


NP-hardness of parametric subshape recognition for an arbitrary number of open terms is proven. Guided by this understanding of the complexity of subshape recognition, a framework for computation-friendly parametric shape grammar interpreters is proposed, which is further detailed by a sub-framework over parametric two-dimensional rectangular shapes. As both the proof of NP-hardness and rectangular sub-framework invoke elements in graph theory, the relationship between shape and graph grammars is also explored

Topics: Graph Grammar, Np Hard, Parametric Subshape Recognition
Year: 2009
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://cumincad.architexturez.... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.