Strictly self-similar fractals composed of star-polygons that are attractors of Iterated Function Systems

In this paper are investigated strictly self-similar fractals that are composed of an infinite number of regular star-polygons, also known as Sierpinski $n$-gons, $n$-flakes or polyflakes. Construction scheme for Sierpinsky $n$-gon and $n$-flake is presented where the dimensions of the Sierpinsky $\infty$-gon and the $\infty$-flake are computed to be 1 and 2, respectively. These fractals are put in a general context and Iterated Function Systems are applied for the visualisation of the geometric iterations of the initial polygons, as well as the visualisation of sets of points that lie on the attractors of the IFS generated by random walks. Moreover, it is shown that well known fractals represent isolated cases of the presented generalisation. The IFS programming code is given, hence it can be used for further investigations.