3
$\begingroup$

fractal

I created it with some simple chaos game restrictions:

  1. You can always move towards the point you moved to on the last step
  2. When on the top left corner, you can go to the right corners
  3. When on the top right corner, you can go to the left corners
  4. When on the bottom corners, you can only go to the corner that is opposite
  • 0
    I don't think there is a name for this one specifically. however it fits in the general framework of IFS: https://en.wikipedia.org/wiki/Iterated_function_system – 2017-01-16
  • 0
    There is an infinity variety of fractals of very many different sorts. This one reminds me of Sierpinski triangle (https://en.wikipedia.org/wiki/Sierpinski_triangle) that, in particular can be generated by L-systems (https://en.wikipedia.org/wiki/L-system). – 2017-01-16
  • 0
    @FranciscoCouzo by the way, did you use a program to make the picture or did you program it yourself? this looks nice :) – 2017-01-16
  • 0
    @Glougloubarbaki I programed it myself, you can play with it [here](https://franciscouzo.github.io/chaos_game/) – 2017-01-16

1 Answers 1

2

Your figure can be constructed by a graph directed iterated function system. An iterated function system typically has no restrictions on which transforms may follow each other. A graph-directed IFS has restrictions like the one you have imposed: there is a directed graph in which the transformations correspond to edges. In your example the nodes of this directed graph would correspond to the corners of your figure, like this:

directed graph

For a reference, with fractal dimension calculations, see:

"Hausdorff dimension in graph directed constructions" R. Daniel Mauldin and S. C. Williams (Trans. Amer. Math. Soc. 309 (1988), 811-829) http://www.ams.org/journals/tran/1988-309-02/S0002-9947-1988-0961615-4/

We introduce the notion of geometric constructions in $R^m$ governed by a directed graph $G$ and by similarity ratios which are labelled with the edges of this graph.