# Hexagonal tiling > [[PORTAL_Cellular_automaton|Cellular automaton]] spine. ## Microsims — three.js <div class="microsim-player"> <iframe src="https://wikitube-3d-microsims.netlify.app/hexagonal_tiling_microsim.html" width="100%" height="520" frameborder="0" loading="lazy" sandbox="allow-scripts allow-same-origin" title="Hexagonal tiling — three.js microsim"></iframe> </div> <p class="wt-pending"><strong>Note:</strong> staged, awaiting CDN deploy — a Geometry-lane three.js asset, reused here since hexagonal tiling is a tree-verified child of [[PORTAL_Cellular_automaton]].</p> A hexagonal tiling is a regular tessellation of the plane by hexagons, three meeting at every vertex — one of exactly three regular tilings possible in two dimensions, alongside the triangular and square tilings. Each cell touches six neighbours edge-to-edge, the same six-neighbour count that makes hexagonal grids a popular alternative lattice for cellular automata and grid-based simulations more generally. ## Overview This build renders the tiling in 3D and lets a viewer explore its structure directly — the geometric backdrop for any cellular-automaton rule defined on a hexagonal rather than square lattice. Compared to a square grid's choice between the four-neighbour [[Von_Neumann_neighborhood|Von Neumann neighborhood]] and the eight-neighbour Moore neighbourhood, a hexagonal grid gives every cell exactly six equidistant neighbours with no diagonal-versus-orthogonal ambiguity, part of why hexagonal automata appear in models of crystal growth, biological cell packing, and other systems where six-fold local symmetry fits the underlying process better than a square grid's four-fold symmetry. **On the spine:** [[Cellular_automaton]] · [[Von_Neumann_neighborhood]] · [[Elementary_cellular_automaton]]. ## Wikipedia : Wikitube **Strict pair:** [Wikipedia](https://en.wikipedia.org/wiki/Hexagonal_tiling) : [Wikitube](https://en.wikitube.io/wiki/Hexagonal_tiling) --- *Repopulated 2026-08-05 · existing three.js asset renamed + wired, Wikipedia-sourced overview · 0 deletions.*