Abstract
With iterated function systems (IFS), there are two classical algorithms of generating artificial fractal pictures: the Deterministic Algorithm and the Random Iteration Algorithm. The Deterministic Algorithm spends huge computations on checking convergence iteratively. On the other hand, the Random Iteration Algorithm is non-deterministic and time consuming. People seldom check convergence by the algorithm. Moreover, many pixels in the picture are computed again and again by both of the algorithms. Thus a new algorithm is given. The algorithm promises convergence without iterative checks. Also, our algorithm runs faster than the existing algorithms do on a large scale. © 2000 IEEE.