Triangular tiling: Difference between revisions
Jump to navigation
Jump to search
Created page with "{{Glossary}} The '''triangular tiling''', '''triangular grid''', '''triangular tessellation''' or '''triangular lattice''' ([https://en.wikipedia.org/wiki/Schl%C3%A4fli_symbol..." |
m link |
||
| Line 1: | Line 1: | ||
{{Glossary}} | {{Glossary}} | ||
The '''triangular tiling''', '''triangular grid''', '''triangular tessellation''' or '''triangular lattice''' ([ | The '''triangular tiling''', '''triangular grid''', '''triangular tessellation''' or '''triangular lattice''' ([[Schläfli symbol]] {3,6}) is one of the three possible proper Euclidean tilings of 2D space, alongside the [[square tiling]] and [[hexagonal tiling]]. It is constructed with six triangles being placed at each vertex. | ||
Of the three regular 2D tilings, it is by far the least investigated, with very little native software support. Native support for triangular rules is offered by some general-purpose cellular automaton simulation programs, although said support is seldom without flaw. | Of the three regular 2D tilings, it is by far the least investigated, with very little native software support. Native support for triangular rules is offered by some general-purpose cellular automaton simulation programs, although said support is seldom without flaw. | ||
Revision as of 21:09, 22 March 2023
The triangular tiling, triangular grid, triangular tessellation or triangular lattice (Schläfli symbol {3,6}) is one of the three possible proper Euclidean tilings of 2D space, alongside the square tiling and hexagonal tiling. It is constructed with six triangles being placed at each vertex.
Of the three regular 2D tilings, it is by far the least investigated, with very little native software support. Native support for triangular rules is offered by some general-purpose cellular automaton simulation programs, although said support is seldom without flaw.