Blending attractors of Iterated Function Systems

In this paper we discuss a new method to blend fractal attractors using the code map for the IFS formed by the Hutchinson--Barnsley operators of a finite family of hyperbolic IFSs. We introduce a parameter called blending coefficient to measure the similarity between the blended set and each one of the original attractors. We also introduce a discrete approximation algorithm and prove a rigorous error estimation used to approximate these new objects. Several simulation results are provided illustrating our techniques.