On integer sequences for rendering limit sets of Kleinian groups
Alessandro Rosa

TL;DR
This paper introduces a new integer sequence-based technique for rendering limit sets of Kleinian groups, aiming to improve memory efficiency and speed over traditional methods.
Contribution
The paper proposes a novel integer sequence method for rendering Kleinian group limit sets, enhancing performance and resource usage.
Findings
Reduced memory consumption compared to traditional methods
Faster rendering of limit sets
Effective for complex Kleinian groups
Abstract
We present a technique for rendering limit sets for kleinian groups, based upon the base transformation of integers and which aims at saving memory resources and being faster than the traditional dictionary based approach.
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 · Topological and Geometric Data Analysis
