Many polygon mesh algorithms operate in a local manner, yet are formally specified using
global indexing schemes. This obscures the essence of these algorithms and makes their …

The concept of tree-based picture generation is introduced. It is shown that there are
equivalent tree-based definitions of four picture-generating devices known from the …

Shape grammars are, in general, intractable. Even amongst tractable shape grammars, their
characteristics vary significantly. This paper describes a paradigm for practical general …

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 …

Tree-based generation of languages of fractals Page 1 Theoretical Computer Science 262 (2001)
377–414 www.elsevier.com/locate/tcs Tree-based generation of languages of fractals Frank …

In this paper, we introduce the notions of context-sensitive and TOL collage grammars as
generalizations of context-free collage grammars. Both kinds of picture-generating devices …

Extension and restriction of derivations are long-known operations in the framework of graph
transformation. In this paper, we continue the study of extension and restriction on the higher …

Collage grammars and context-free chain-code grammars are compared with respect to
their generative power. It is shown that the generated classes of line-drawing languages are …

Problem synthesis is a formal task in Artificial Intelligence. This task involves the automatic
generation of problems and their respective solutions across different domains (including …

Interlacing knotwork forms a significant part of celtic art. From the perspective of computer
science, it is a visual language following mathematically precise rules of construction. In this …