In this paper, we consider a large variety of solutions for the generation of Sierpinski triangles, one of the case studies
for the AGTIVE graph transformation tool contest [15]. A Sierpinski triangle shows a well-known fractal structure. This case
study is mostly a performance benchmark, involving the construction of all triangles up to a certain number of iterations.
Both time and space performance are involved. The transformation rules themselves are quite simple.