Generating Tree Structures for Hyperbolic Tessellations

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.

References in corpus (5)

• Popularity versus Similarity in Growing Networks
• Sustaining the Internet with Hyperbolic Mapping
• No-go Theorem for Acceleration in the Hyperbolic Plane
• Hyperbolic triangulations and discrete random graphs
• Real-Time Visualization in Non-Isotropic Geometries