Computing raster images from grid picture grammars

Authors:
Frank Drewes;Sigrid Ewert;Renate Klempien-Hinrichs;Hans-Jörg Kreowski
Affiliations:
Department of Computing Science, Umeå University, S-901 87 Umeå, Sweden;School of Computer Science, University of the Witwatersrand, Johannesburg, Private Bag 3, 2050 Wits, South Africa;Department of Computer Science, University of Bremen, P.O. Box 330440, D-28334 Bremen, Germany;Department of Computer Science, University of Bremen, P.O. Box 330440, D-28334 Bremen, Germany
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2003

Citing 6
Cited 2

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

Picture Languages: From Wang Tiles to 2D Grammars

CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Selected decision problems for square-refinement collage grammars

Algebraic Foundations in Computer Science

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.