
Recent Posts
 A rosette in a roman mosaic is an exponential transform of a periodic tiling
 Fractal tiling of a sphere with octahedral twocolour symmetry
 A fractal tiling of both octahedral and icosahedral symmetry
 A variant of the Apollonian gasket with icosahedral symmetry
 Apollonian gasket as a fractal in tiled hyperbolic space
Recent Comments
Archives
 September 2019
 August 2019
 July 2019
 April 2019
 March 2019
 November 2018
 October 2018
 September 2018
 August 2018
 March 2018
 February 2018
 January 2018
 December 2017
 November 2017
 September 2017
 August 2017
 July 2017
 June 2017
 May 2017
 February 2017
 January 2017
 November 2016
 February 2014
 January 2014
 December 2013
 November 2013
 October 2013
 September 2013
 August 2013
 May 2013
 April 2013
 March 2013
 February 2013
 January 2013
 December 2012
 November 2012
 October 2012
 September 2012
 August 2012
 July 2012
 June 2012
 May 2012
 April 2012
Categories
Meta
Tag Archives: Von Neumann neighborhood
Cellular automaton on quasiperiodic tiling
Any tiling can be used to define a cellular automaton. The tiles (squares, triangles, rhombs and other polygons) are simply the cells. Each tile has all other tiles with a common edge in its von Neumann neighborhood. I use the … Continue reading
Cellular automation on the lattice of triangles
The tessellation of triangles can easily be mapped onto the square lattice, see the figures at the left and right. Upright triangles (colored green) and upsidedown triangles (white) go into separate rows. The lines of interaction for the Von Neumann … Continue reading
Posted in Cellular automata
Tagged Cellular automaton, triangular lattice, Von Neumann neighborhood
Leave a comment
Hexagonal cellular automaton in color
The images from the hexagonal cellular automaton shown in “Basic parity rule – sample images ” and “Modified parity rule – sample images ” are only black and white. But I prefer color. To get similar images in color I modified the … Continue reading
The parity rule on a hexagonal lattice
The MIT group of E. Fredkin, N. Margolus, T. Toffoli and G.Y. Vichniac has studied many cellular automata on the square lattice. We can use their ideas as recipes to run on the hexagonal lattice. Particularly simple is the parity … Continue reading
Hexagonal cellular automata
Earlier I used a complicated cellular automaton to create images of snowflakes, see “Fake snowflakes“. It is based on a hexagonal grid in contrast to the wellknown cellular automata such as Conway’s game of life, that use square grids. Here … Continue reading