A new way to implement cellular automata on the penta- and heptagrids
The contribution adopts a combinatorial approach to hyperbolic geometry and it is aimed at possible applications to computer simulations. It is based on the splitting method which was introduced by the author and which is reminded in the second section of the paper. Then we sketchily remind the application to the classical case of the pentagrid, i.e. the tiling of the hyperbolic plane which is generated by reflections of the regular rectangular pentagon in its sides and, recursively, of its images in their sides. From this application, we derived a system of coordinates to locate the tiles, allowing an implementation of cellular automata. In this paper, we give another system of coordinates whose main advantage is to be free of a unique origin of the coordinates. In our new system, changing of coordinates is easier, although restricted to a certain condition. Also, the interest of the new system is to preserve the existence of a linear algorithm to find a quasi-geodesic path between two tiles. We indicate also an algorithm which implements the search of this path in a cellular automaton implemented on the pentagrid.
cellular automata hyperbolic geometry discrete computations universality 3d space