Computing Raster Images from Grid Picture Grammars

Authors:
Frank Drewes;Sigrid Ewert;Renate Klempien-Hinrichs;Hans-Jörg Kreowski
Affiliations:
-;-;-;-
Venue:
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Year:
2000

Citing 6
Cited 0

The algorithmic beauty of plants

The algorithmic beauty of plants
Affine automata and related techniques for generation of complex images

Theoretical Computer Science
Language theoretic and algorithmic properties of d-dimensional collages and patterns in a grid

Journal of Computer and System Sciences
Tree languages

Handbook of formal languages, vol. 3
Picture generation by collage grammars

Handbook of graph grammars and computing by graph transformation
Chaos and Fractals

Chaos and Fractals

Quantified Score

Hi-index	0.00

Visualization

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.