A new indexed approach to render the attractors of Kleinian groups

TL;DR

This paper introduces a faster, more memory-efficient method for rendering Kleinian group attractors by replacing the traditional words array with an integer-based approach.

Contribution

It presents a novel indexed technique that reduces memory usage and improves rendering speed for Kleinian group attractors compared to existing methods.

Findings

Significantly reduces memory consumption

Speeds up the rendering process

Maintains accuracy of attractor visualization

Abstract

One widespread procedure to render the attractor of Kleinian groups, published in the renown book "Indra's Pearls" and based upon a combinatorial tree model, wants huge memory resources to compute and store all the words required. We will present here a new faster and lighter version which drops the original words array and pulls out words from integer numbers.