Generating Tree Structures for Hyperbolic Tessellations
Dorota Celi\'nska-Kopczy\'nska, Eryk Kopczy\'nski
TL;DR
This paper presents an efficient algorithm for generating geodesic regular tree structures in hyperbolic and Euclidean tessellations, with experimental validation of its performance.
Contribution
The paper introduces a novel algorithm for constructing tree structures in hyperbolic tessellations, improving efficiency and applicability.
Findings
Algorithm successfully generates geodesic trees in hyperbolic tessellations.
Experimental results confirm the algorithm's efficiency.
Applicable to both hyperbolic and Euclidean 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Numerical Analysis Techniques · Artificial Intelligence in Games