|[Tae:07]||Rubino GeiÃ, Gabriele Taentzer and Enrico Biermann and DÃ©nes Bisztray and Bernd Bohnet and Iovka Boneva and Artur Boronat and Leif Geiger and Ãkos Horvath and Ole Kniemeyer and Tom Mens and Benjamin Ness et al, Generation of Sierpinski Triangles: A Case Study for Graph Transformation Tools, A. SchÃ¼rr and M. Nagl and A. ZÃ¼ndorf (Ed.), Proc. 3rd Intl. Workshop on Applications of Graph Transformation with Industrial Relevance (AGTIVE '07), Springer, 2008 (http://www.springerlink.com/content/105633/).
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. 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.