One widespread procedure to render the attractor of Kleinian groups, appearing in the renown book [8], wants 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.
Rosa, A. (2017). A new indexed approach to render the attractors of Kleinian groups. Journal of Algorithms and Computation, 49(2), 53-62. doi: 10.22059/jac.2017.7977
MLA
Alessandro Rosa. "A new indexed approach to render the attractors of Kleinian groups". Journal of Algorithms and Computation, 49, 2, 2017, 53-62. doi: 10.22059/jac.2017.7977
HARVARD
Rosa, A. (2017). 'A new indexed approach to render the attractors of Kleinian groups', Journal of Algorithms and Computation, 49(2), pp. 53-62. doi: 10.22059/jac.2017.7977
VANCOUVER
Rosa, A. A new indexed approach to render the attractors of Kleinian groups. Journal of Algorithms and Computation, 2017; 49(2): 53-62. doi: 10.22059/jac.2017.7977
)