The Hexagon-Triangle neighbourhood

(t & 1) = 0

(t & 1) = 1

(t & 1) = 0   (t & 1) = 1


oscillating image

This neighbourhood uses different types of partitioning on alternate timesteps.

Hexagonal regions (with six sections) are updated on one time step, and triangular regions (with three) are updated on the next.

This neighbourhood appears to offer few practical advantages over the Star of David neighbourhood.

A hardware implementation seems likely to take up more space - and has the added complication of an alternating updating scheme to deal with.

Tim Tyler | |