Self-similar fractals can be generated by cellular automata
B Martin - Cellular Automata and Cooperative Systems, 1993 - Springer
Cellular Automata and Cooperative Systems, 1993•Springer
The goal of this paper is to give a formalism for the generation of a certain class of fractals as
configurations of cellular automata. The class which can be generated is a subclass of the
fractals obtained by the usual IFS methods. We consider then strict self-similar fractals, that
is the class of fractals that can be generated using iterations of contracting similitudes. We
give the examples of the construction of simple fractal sets.
configurations of cellular automata. The class which can be generated is a subclass of the
fractals obtained by the usual IFS methods. We consider then strict self-similar fractals, that
is the class of fractals that can be generated using iterations of contracting similitudes. We
give the examples of the construction of simple fractal sets.
Abstract
The goal of this paper is to give a formalism for the generation of a certain class of fractals as configurations of cellular automata. The class which can be generated is a subclass of the fractals obtained by the usual IFS methods. We consider then strict self-similar fractals, that is the class of fractals that can be generated using iterations of contracting similitudes. We give the examples of the construction of simple fractal sets.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果