Generating Tree Structures for Hyperbolic Tessellations
Formal Languages and Automata Theory
2022-03-18 v2 Computational Geometry
Cellular Automata and Lattice Gases
Abstract
We show an efficient algorithm for generating geodesic regular tree structures for periodic hyperbolic and Euclidean tessellations and experimentally verify its performance on tessellations.
Cite
@article{arxiv.2111.12040,
title = {Generating Tree Structures for Hyperbolic Tessellations},
author = {Dorota Celińska-Kopczyńska and Eryk Kopczyński},
journal= {arXiv preprint arXiv:2111.12040},
year = {2022}
}