2000 character limit reached
Generating Tree Structures for Hyperbolic Tessellations
Published 23 Nov 2021 in cs.FL, cs.CG, and nlin.CG | (2111.12040v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.