arXiv · 2510.14474
Blending attractors of Iterated Function Systems
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Elismar R. Oliveira. 2025-10-16. Blending attractors of Iterated Function Systems. https://arxiv.org/abs/2510.14474
Cite the original work for its findings. Save a collection to share your selection of sources.