Planar Trivalent Network Growth Using Two Rewrite Rules

Explore various growth patterns for planar trivalent networks ("trinets") by assigning values to three parameters of a network mobile-automaton algorithm.
The model is somewhat similar to two-dimensional Turing machines, except that the nodes in the network do not carry any value and only control updates to the local structure of the trinet, while moving by small steps. The initial trinet is fixed: a graph with two nodes and three parallel edges connecting them.



  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


The trinet growth algorithm uses two rewrite rules: 'Refin' essentially replaces a node by a triangle and 'Diags' affects the topology of the network, locally, without changing the number of nodes. These are the first two rules in the three-slot picture on page 1038 of the NKS book, sometimes called T2 and T1; they preserve planarity and, if 'Refin' is used in both directions, they form a complete set that allows you to rewrite any planar trinet into any other. The choice of which rule to apply at each step depends on the sizes of two adjacent polygonal faces of the planar trinet: if one or both faces have less than the threshold parameter value, 'Refin' is applied, which creates a new triangular face and increases the sizes of three existing faces; otherwise, 'Diags' is applied, which decreases by one the sizes of two faces and increases by one the sizes of two other faces. The control parameters 'RefinCode' and 'DiagsCode' are used for deciding where to move the control point when rule 'Refin' or 'Diags' is applied.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.