Triangular tiling: Difference between revisions
Jump to navigation
Jump to search
reword, category |
links |
||
| Line 3: | Line 3: | ||
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. | ||
==See also== | |||
* [[Triangular neighbourhood]] | |||
==Further reading== | |||
* {{LinkForumThread|format=ref|f=11|t=960|title=Triangular neighborhood (Carter Bays' TriLife rules)}} | |||
[[Category:Mathematical miscellany]] | [[Category:Mathematical miscellany]] | ||
Revision as of 08:32, 27 March 2023
The triangular tiling, triangular grid, triangular tessellation or triangular lattice (Schläfli symbol {3,6}) is one of the three possible regular tilings of the plane, 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.
See also
Further reading
- Triangular neighborhood (Carter Bays' TriLife rules) (discussion thread) at the ConwayLife.com forums