Abstract
Article Outline: Glossary Definition of the Subject Introduction Two Dimensional Cellular Automata in the Triangular Grid The Hexagonal Grid The Pentagonal Grid Programming Tips Future Directions Bibliography Typically, cellular automata (CA) are defined in Cartesian space (e.g.a square grid). Here weexplore characteristics of CA in triangular and other non-cartesian grids. Methods for programming CA for these non-cartesian grids are brieflydiscussed.
Cite
CITATION STYLE
Bays, C. (2013). Cellular automata in triangular, pentagonal and hexagonal tessellations. In Computational Complexity: Theory, Techniques, and Applications (Vol. 9781461418009, pp. 434–442). Springer New York. https://doi.org/10.1007/978-1-4614-1800-9_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
