Generation of Sierpinski Triangles: A Case Study for Graph Transformation Tools

  • Authors:
  • Gabriele Taentzer;Enrico Biermann;Dénes Bisztray;Bernd Bohnet;Iovka Boneva;Artur Boronat;Leif Geiger;Rubino Geiß;Ákos Horvath;Ole Kniemeyer;Tom Mens;Benjamin Ness;Detlef Plump;Tamás Vajk

  • Affiliations:
  • Philipps-Universität Marburg, Germany;Technische Universität Berlin, Germany;University of Leicester, UK;Universität Stuttgart, Germany;University of Twente, The Netherlands;University of Leicester, UK;Kassel University, Germany;Universität Karlsruhe, Germany;Budapest University of Technology and Economics, Hungary;BTU Cottbus, Germany;University of Mons-Hainaut, Belgium;Vanderbilt University, US;The University of York, UK;Budapest University of Technology and Economics, Hungary

  • Venue:
  • Applications of Graph Transformations with Industrial Relevance
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.