ملخص: This paper describes a method for estimating probability that the Chaos Game generates, within L steps, a sequence ofpoints which approximates the IFS attractor at a given accuracy. The presented algorithm is a hybrid based on methods from the theory of Markov chains used in the pattern- matching context. Unlike the previous approaches, ours is general both in the sense ofcomponent IFS mappings and the associated probability distribution.

لغة: إنجليزية