There are several methods for rendering fractal images based on IFS (Iterated Function System) in computer graphic; but one concern of the computer graphic community has been the efficiency rendering algorithms. The i...There are several methods for rendering fractal images based on IFS (Iterated Function System) in computer graphic; but one concern of the computer graphic community has been the efficiency rendering algorithms. The invariant measures arising from IFSP (Iterate Function System with Probability) using the probabilistic algorithm are also known as chaos games. The role of these probabilities to generate the image of the attractor has been investigated using a multi-fractal analysis. The conventional choice of probability associated with each set /S/ to generate the attractor in least time possible is introduced, then a new method based on the self similarity and multi-fractal analysis is presented. The efficiency of the new method has been proved over the conventional method.展开更多
文摘There are several methods for rendering fractal images based on IFS (Iterated Function System) in computer graphic; but one concern of the computer graphic community has been the efficiency rendering algorithms. The invariant measures arising from IFSP (Iterate Function System with Probability) using the probabilistic algorithm are also known as chaos games. The role of these probabilities to generate the image of the attractor has been investigated using a multi-fractal analysis. The conventional choice of probability associated with each set /S/ to generate the attractor in least time possible is introduced, then a new method based on the self similarity and multi-fractal analysis is presented. The efficiency of the new method has been proved over the conventional method.
