Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Computing Raster Images from Grid Picture Grammars
| |
|
Computing Raster Images from Grid Picture Grammars
Frank Drewes5  , Sigrid Ewert6 , Renate Klempien-Hinrichs7 and Hans-Jörg Kreowski7
| (5) |
Department of Computing Science, Umeå University, S, 901 87 Umeå, Sweden |
| (6) |
Department of Computer Science, University of the Witwatersrand, Johannesburg, Private Bag 3, 2050 Wits, South Africa |
| (7) |
Department of Computer Science, University of Bremen, 33 04 40, D, 28334 Bremen, Germany |
Abstract
While a 2-dimensional grid picture grammar may generate pictures (defined as subsets of the unit square) with arbitrarily
small details, only a finite number of them can be made visible as raster images for any given raster. We present an algorithm
based on bottom-up tree automata which computes the set of all raster images of the pictures generated by a given grid picture
grammar.
Partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems), the ESPRIT Basic Research
Working Group APPLIGRAPH (Applications of Graph Transformation), and the Deutsche Forschungsgesellschaft (DFG) under grant no. Kr-964/6-1
This research was performed while the author was a postdoctoral fellow at the University of Bremen, funded by the National
Research Foundation of South Africa.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|