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. |
Year | DOI | Venue |
---|---|---|
2007 | 10.1007/978-3-540-89020-1_35 | AGTIVE |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Fractal,Spacetime,Graph rewriting,Sierpinski triangle,Nested triangles graph,Metamodeling,Mathematics,Chaos game | Conference | 5088 |
ISSN | Citations | PageRank |
0302-9743 | 19 | 1.35 |
References | Authors | |
5 | 14 |
Name | Order | Citations | PageRank |
---|---|---|---|
Gabriele Taentzer | 1 | 2667 | 196.98 |
Enrico Biermann | 2 | 409 | 23.83 |
Dénes Bisztray | 3 | 91 | 6.23 |
Bernd Bohnet | 4 | 524 | 38.19 |
Iovka Boneva | 5 | 124 | 12.41 |
Artur Boronat | 6 | 286 | 14.20 |
Leif Geiger | 7 | 145 | 15.36 |
Rubino Geiß | 8 | 190 | 12.61 |
Ákos Horváth | 9 | 379 | 26.87 |
Ole Kniemeyer | 10 | 83 | 8.01 |
Tom Mens | 11 | 3018 | 181.32 |
Benjamin Ness | 12 | 23 | 2.13 |
Detlef Plump | 13 | 604 | 62.14 |
tamas vajk | 14 | 66 | 7.77 |