Making the computation of approximations of invariant measures and its attractors for IFS and GIFS, through the deterministic algorithm, tractable

We present algorithms to compute approximations of invariant measures and its attractors for IFS and GIFS, using the deterministic algorithm in a tractable way, with code optimization strategies and use of data structures and search algorithms. The results show that these algorithms allow the use of these (G)IFS in a reasonable running time.