Square tiling: Difference between revisions
Jump to navigation
Jump to search
Created page with "{{Glossary}} The '''square grid''', '''square tiling''' or '''square tessellation''' is one of the three possible proper Euclidean tilings of 2D space, in which four squares a..." |
No edit summary |
||
| Line 3: | Line 3: | ||
The square grid is the most familiar of all 2D tilings, with cell positions being easily and uniquely defined via Cartesian coordinates, and is the grid on which [[cellular automata]] are simulated most frequently. | The square grid is the most familiar of all 2D tilings, with cell positions being easily and uniquely defined via Cartesian coordinates, and is the grid on which [[cellular automata]] are simulated most frequently. | ||
== Neighbourhoods on the square grid == | |||
== Symmetries == | |||
Revision as of 13:24, 11 January 2022
The square grid, square tiling or square tessellation is one of the three possible proper Euclidean tilings of 2D space, in which four squares are placed at each vertex.
The square grid is the most familiar of all 2D tilings, with cell positions being easily and uniquely defined via Cartesian coordinates, and is the grid on which cellular automata are simulated most frequently.