morphogen.automata

Cellular automata and lattice growth processes.

  • morphogen.automata.lattice: neighbourhoods (von Neumann, Moore, edges, Euclidean; 2D or 3D), neighbour counts and FFT neighbourhood sums;

  • morphogen.automata.rules: transition rules (Life-like B/S, majority, annealing, majority at conserved volume fraction, probabilistic, Young’s activator-inhibitor);

  • morphogen.automata.engine: synchronous, asynchronous and sequential evolution, with the history of the volume fraction and of the interface density;

  • morphogen.automata.reaction: Gray-Scott reaction-diffusion on the grid and, with finite-volume Laplacians, on tilings;

  • morphogen.automata.tilings: other lattices of cells (triangles, hexagons, Penrose rhombi, Ammann-Beenker squares and rhombi, prisms, BCC and FCC Voronoi cells, golden rhombohedra; the periodic approximants of the quasi-periodic ones) with CSR neighbourhoods.

Public names

  • ActivatorInhibitorRule — Young’s (1984) activator-inhibitor automaton.

  • CellularAutomaton — Binary automaton: a rule acting on a neighbourhood of a periodic or fixed lattice, the square grid or a tiling (whose dims and periodic then apply; finite patches have free boundaries, boundary is ignored).

  • ConservedMajorityRule — Majority with a conserved number of cells in state 1 (fraction of the cells): the cells of highest local density of phase 1 win, ties broken at random (the density is the fraction of phase 1 in the neighbourhood and the cell when neighbourhoods differ in size).

  • Evolution — Final state and history (one entry per recorded step) of a run.

  • LatticeContext — Neighbourhood and boundary of the lattice on which a rule acts.

  • LifeRule — Outer-totalistic rule B<birth>/S<survival>.

  • MajorityRule — Majority vote over the neighbourhood and the cell itself; twist inverts the outcome of the two votes closest to a tie (Vichniac’s annealing rule).

  • ProbabilisticRule — Birth with probability p_birth[n] and survival with p_survival[n] (arrays indexed by the number n of neighbours in state 1).

  • Rule — Transition rule of a binary automaton.

  • Tiling — Cells of a tiling: centres, shapes, areas or volumes and adjacency.

  • TilingContext — Neighbourhood of the cells of a tiling on which a rule acts: the counterpart of LatticeContext, for states holding one value per cell. n_neighbours is a number, or an array when cells differ (Penrose tilings, edges of finite patches).

  • interface_density — Mean fraction, over the three axes, of pairs of adjacent cells in different states (twice its value divided by the cell size estimates the specific surface).

  • kernel_sum — Weighted sum of field over the neighbourhood offs of every cell (float).

  • make_rule — A rule from a name (majority, anneal, conserved, life, clouds), a B.../S... string, or a Rule.

  • make_tiling — Tiling name (see LATTICES) of the box origin + [0, size].

  • neighbour_counts — Number of cells in state 1 among the neighbours offs of every cell.

  • offsets — Integer offsets (k, 3) of the cells of a neighbourhood.

  • random_state — Random binary state: each cell is 1 with probability fraction (or exactly round(fraction * n) cells at random positions with exact).

  • sublattices — Partition of the cells into sublattices whose cells are not neighbours (radius 1).

Modules