Citer cet article
Fac-similé [PDF, 9.0M]

Generating Self-Symmetrical Fractals by Hyperincursive Automata and Multiple Reduction Copy Machine

Daniel M. Dubois et Mathieu Belly

p. 95-115

    Résumé

    This paper shows that different algorithmic methods can generate self-symmetrical Sierpinski fractals. A first category deals with a hyperincursive generator based on a composition rule applied to a defined path in the frame. A second category of algorithms is based on a recursive generator obeying certain symmetries. This paper will consider generalised Sierpinski fractals generated by modulo 2 and modulo 3. Even and odd modulo give rise to very different properties of symmetry.

    Index

    Keywords

    Sierpinski gasket, fractal, recursive generator, hyperincursive frame, algorithms

    Texte

    Version Fac-similé [PDF, 9.0M]

    Citer cet article

    Référence papier

    Daniel M. Dubois et Mathieu Belly, « Generating Self-Symmetrical Fractals by Hyperincursive Automata and Multiple Reduction Copy Machine », CASYS, 6 | 2000, 95-115.

    Référence électronique

    Daniel M. Dubois et Mathieu Belly, « Generating Self-Symmetrical Fractals by Hyperincursive Automata and Multiple Reduction Copy Machine », CASYS [En ligne], 6 | 2000, mis en ligne le 18 June 2024, consulté le 20 September 2024. URL : http://popups.lib.uliege.be/1373-5411/index.php?id=156

    Auteurs

    Daniel M. Dubois

    Centre for Hyperincursion and Anticipation in Ordered Systems, CHAOS asbl, Institute of Mathematics, B37, University of Liège, Grande Traverse 12, B-4000 Liège, BELGIUM

    Articles du même auteur

    Mathieu Belly

    Liège, BELGIUM

    Droits d'auteur

    CC BY-SA 4.0 Deed