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

TL;DR

This paper introduces optimized algorithms for efficiently approximating invariant measures and attractors of IFS and GIFS using deterministic methods, making their computation more practical.

Contribution

It presents optimized deterministic algorithms with code and data structure enhancements for tractable computation of (G)IFS invariant measures and attractors.

Findings

Algorithms enable reasonable computation times for (G)IFS.

Code optimization improves efficiency.

Practical application of (G)IFS in various fields.

Abstract

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.