Continuing the study on cell closing, aggregations are formed partially using graph grammar.

Based on a previously found aggregation that forms a closed cell, the sequence of connection rules (graph grammar) is reconstructed. This cell of 4 parts is defined as a new part type (yellow), and combined with the basic part (purple) to assemble aggregations.

Stochastic aggregations with both parts show that no cross-connections emerge, however besides the ready-made cells, additional closed sequences appear occasionally (see outlined geometry in image above).


In some instances, the system almost closes, perhaps with an additional transformation of the parts or with the help of a bridging element, cross-connections could be established.

Larger cells
Studies with lager predefined cells (yellow) show the same result: cross-connections rarely occur.


Continue to next study…