NP problems are tractable in the space of cellular automata in the hyperbolic plane
Theoretical Computer Science
Word Processing in Groups
Effective simulations on hyperbolic networks
Fundamenta Informaticae - Special issue on cellular automata
A universal cellular automaton in the hyperbolic plane
Theoretical Computer Science
Cellular automata and combinatoric tilings in hyperbolic spaces: a survey
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Register cellular automata in the hyperbolic plane
Fundamenta Informaticae
Surprising Areas in the Quest for Small Universal Devices
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
In this paper, we pay a new visit to an object of hyperbolic geometry which, perhaps, did not draw on itself all the attention it may deserve. The paper gives a simple definition of this object, infinigons, which was implicit in general considerations about filings of the hyperbolic plane, and which was not definied in its all possible extensions. From the simple construction of the infinigons and using the ideas of the splitting method being introduced by the author in the case of tilings being based on the replication of regular polygons, we give an algorithmic construction of the infinigrids. On the way, we give a simple geometrical characterisation of the infinigons in terms of pencils of lines.