| The Random IFS algorithm generates an image by applying the IFS transformations one at a time in random order, with frequency determined by the probability assigned to each transformation. |
| For example, if we apply the transformation for the small right piece and the transformation for everything else with equal probability, the small right piece fills in quickly, while everything else is filled slowly indeed. |
![]() |
| equal probabilities |
To achieve uniform fill, the probability of applying each transformation Ti should equal the fraction of the total shape S occupied by Ti(S). This fraction can be estimated in two ways.
Visual Approach Visually inspect the whole picture and estimate what percentage of the whole is occupied by each region of the decomposition. By trial and error adjustments, this initial estimate can be modified to give a satisfactory picture.
Computational Approach If all rotations are rigid (
|r1s1| + |r2s2| + ... + |rNsN|,
and pi, the probability of applying Ti is
pi = |risi|/(|r1s1| + |r2s2| + ... + |rNsN|)
Adjust any rounding errors so that the probabilities sum to 1.
![]() |
What probabilities should we use? What percentage of the area of the whole spiral do the two copies each occupy?
Return to background.