Algorithms generating images of attractors of generalized iterated function systems

From MaRDI portal
Publication:329321

DOI10.1007/S11075-016-0104-0zbMATH Open1366.37026arXiv1601.03200OpenAlexW2239295213MaRDI QIDQ329321FDOQ329321


Authors: Patrycja Jaros, Łukasz Maślanka, Filip Strobin Edit this on Wikidata


Publication date: 21 October 2016

Published in: Numerical Algorithms (Search for Journal in Brave)

Abstract: The paper is devoted to searching algorithms which will allow to generate images of attractors of emph{generalized iterated function systems} (GIFS in short), which are certain generalization of classical iterated function systems, defined by Mihail and Miculescu in 2008, and then intensively investigated in the last years (the idea is that instead of selfmaps of a metric space X, we consider mappings form the Cartesian product Ximes...imesX to X). Two presented algorithms are counterparts of classical emph{deterministic algorithm} and so-called emph{chaos game}. The third and fourth one one is fitted to special kind of GIFSs - to emph{affine} GIFS, which are, in turn, also investigated.


Full work available at URL: https://arxiv.org/abs/1601.03200




Recommendations




Cites Work


Cited In (16)





This page was built for publication: Algorithms generating images of attractors of generalized iterated function systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329321)