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. © 2008 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Taentzer, G., Biermann, E., Bisztray, D., Bohnet, B., Boneva, I., Boronat, A., … Vajk, T. (2008). Generation of Sierpinski triangles: A case study for graph transformation tools. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5088 LNCS, pp. 514–539). Springer Verlag. https://doi.org/10.1007/978-3-540-89020-1_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
