A new indexed approach to render the attractors of Kleinian groups

Abstract

One widespread procedure to render the attractor of Kleinian groups, appearing in the renown book [8], wants<br />huge memory resources to compute and store the results. We present a new faster and lighter version that drops the original array and pulls out group elements from integers.