Composite Shape Rules

Abstract

Generally, non-terminal symbols such as labeled points are used to constrain rule application and, thereby, guide rule selection in the application of shape grammars. However, distinguishing between salient rules that offer the user design choices and deterministic rules that together and in a certain order (mechanically) complete a specific design transformation, may require other means of guiding rule selection that better reflect on the logic of the rule derivation process. We present a concept of composite shape rules embedding algorithmic patterns for rule automation. We denote these composite shape rules flows, and adopt a notation from regular expressions. In this paper, we describe the context that led to the conception of this approach, describe the sequencing mechanisms, and present a case study. We conclude with a brief discussion disclosing additional potential of the notation. Generally, non-terminal symbols such as labeled points are used to constrain rule application and, thereby, guide rule selection in the application of shape grammars. However, distinguishing between salient rules that offer the user design choices and deterministic rules that together and in a certain order (mechanically) complete a specific design transformation, may require other means of guiding rule selection that better reflect on the logic of the rule derivation process. We present a concept of composite shape rules embedding algorithmic patterns for rule automation. We denote these composite shape rules flows, and adopt a notation from regular expressions. In this paper, we describe the context that led to the conception of this approach, describe the sequencing mechanisms, and present a case study. We conclude with a brief discussion disclosing additional potential of the notation.