The algorithmic beauty of plants
The algorithmic beauty of plants
Visual models of plants interacting with their environment
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Handbook of graph grammars and computing by graph transformation
Programmed graph replacement systems
Handbook of graph grammars and computing by graph transformation
The PROGRES approach: language and environment
Handbook of graph grammars and computing by graph transformation
The use of positional information in the modeling of plants
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
A Model for the Growth and Flowering of Aster Novae-Angliae on the Basis of Table L-Systems
L Systems, Most of the papers were presented at a conference in Aarhus, Denmark
Evolutionary Grammars: A Grammatical Model for Genome Evolution
Selected papers from the German Conference on Bioinformatics
Applications of Graph Transformations with Industrial Relevance
A graph-based developmental swarm representation and algorithm
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Growing virtual plants for virtual worlds
Proceedings of the 24th Spring Conference on Computer Graphics
Self-repair ability of a toroidal and non-toroidal cellular developmental model
ECAL'05 Proceedings of the 8th European conference on Advances in Artificial Life
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
Computers and Electronics in Agriculture
| Hi-index | 0.00 |
We present the high-level language of relational growth grammars (RGGs) as a formalism designed for the specification of ALife models. RGGs can be seen as an extension of the well-known parametric Lindenmayer systems and contain rule-based, procedural, and object-oriented features. They are defined as rewriting systems operating on graphs with the edges coming from a set of user-defined relations, whereas the nodes can be associated with objects. We demonstrate their ability to represent genes, regulatory networks of metabolites, and morphologically structured organisms, as well as developmental aspects of these entities, in a common formal framework. Mutation, crossing over, selection, anti the dynamics of a network of gene regulation can all be represented with simple graph rewriting rules. This is demonstrated in some detail on the classical example of Dawkins' biomorphs and the ABC model of flower morphogenesis: other applications are briefly sketched. An interactive program was implemented, enabling the execution of the formalism and the visualization of the results.