Date of Original Version

6-2009

Type

Conference Proceeding

Published In

Proceedings of CAAD futures 2009 (eds T Tidafi & T Dorta), pp 757-770

Abstract or Table of Contents

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.

Included in

Architecture Commons

Share

COinS