Hexagonal tiling: Difference between revisions
Jump to navigation
Jump to search
m AwesoMan3000 moved page Hexagonal grid to Hexagonal tiling |
Removed redirect to Hexagonal neighbourhood Tag: Removed redirect |
||
| Line 1: | Line 1: | ||
{{Glossary}} | |||
The '''hexagonal tiling''', '''hexagonal grid''', '''hexagonal tessellation''' or '''hexagonal lattice''' ([https://en.wikipedia.org/wiki/Schl%C3%A4fli_symbol Schläfli symbol]: {6,3}) is one of the three possible proper Euclidean tilings of 2D space, alongside the [[square tiling]] and [[triangular tiling]]. It is constructed with three hexagons being placed at each vertex. | |||
While not nearly as heavily investigated as the square tiling, many general-purpose cellular automaton simulation programs support hexagonal tilings to an extent. However, since most of these have a primary focus on square tilings, such support is seldom without flaw. | |||
== Neighbourhoods on the hexagonal tiling == | |||
Revision as of 14:52, 11 January 2022
The hexagonal tiling, hexagonal grid, hexagonal tessellation or hexagonal lattice (Schläfli symbol: {6,3}) is one of the three possible proper Euclidean tilings of 2D space, alongside the square tiling and triangular tiling. It is constructed with three hexagons being placed at each vertex.
While not nearly as heavily investigated as the square tiling, many general-purpose cellular automaton simulation programs support hexagonal tilings to an extent. However, since most of these have a primary focus on square tilings, such support is seldom without flaw.