Product Description
This book introduces the reader to the notions, the techniques, and the theory of grammatical picture generation, a research field focusing on formal systems that describe sets of pictures by means of syntactic rules. The book presents important types of picture generators, using a tree-based approach to stress their common algorithmic basis, the treatment influenced by the theory of computation, and the theory of formal languages in particular. It guides the reader through the basics of the tree-based approach on to dedicated chapters on line-drawing languages, collage grammars, iterated function systems, grid picture languages, languages of fractals, and languages of coloured collages, while presenting results about (un)decidable, NP-complete, or efficiently solvable problems, normal forms, hierarchies of language classes, and related phenomena. In support, the book contains detailed exercises throughout, and the software on the enclosed CD allows the reader to experiment with the picture generators explained in the text. The book is of interest to researchers and graduate students in computer science and mathematics who are engaged with the theory and practice of picture-generating systems. |
take Iterated Function Systems to a profounder level 
In the early 90s, Michael Barnsley came out with a nifty book, Fractals Everywhere, that described the use of Iterated Function Systems to draw lovely fractal images. That text was readily understandable to anyone with an undergrad background in computer programming and maths. But did you ever wonder how deeply and far the idea of iterated functions could go?
One answer is in Drewes' book. It looks at pictures, and how these might be drawn using the concepts of grammar and trees in graph theory. An entire chapter expounds directly on iterated functions, and where they sit in this broader schema. Vast new vistas are opened. Using such concepts as a picture algebra to unify different viewpoints. Like Barnsley's book, there are numerous diagrams, including some pretty computer renderings.
Be warned, however, that Drewes writes for a more exclusive audience. The maths requires the equivalent of an honours level coursework in analysis. Along with knowing the theory of compilers and computer language grammars.
April 23, 2007 | |
