Self-Similarity in Plants: Integrating Mathematical and Biological Perspectives

Self−similarity is a conspicuous feature of many plants. Geometric self−similarity is commonly expressed in terms of affine transformations that map a structure into its components. Here we introduce topological self−similarity, which deals with the configurations and neighborhood relations between these components instead. The topological self−similarity of linear and branching structures is characterized in terms of recurrence systems defined within the theory of L−systems. We first review previous results, relating recurrence systems to the patterns of development that can be described using deterministic context−free L−systems. We then show that topologically self−similar structures may become geometrically self−similar if additional geometric constraints are met. This establishes a correspondence between recurrence systems and iterated function systems, which is of interest as a mathematical link between L−systems and fractals. The distinction between geometric and topological self−similarity is useful in biological applications, where topological self−similarity is more prevalent then geometric self−similarity.

[1]  Przemyslaw Prusinkiewicz,et al.  Parametric l-systems and their application to the modelling and visualization of plants , 1992 .

[2]  C.J.H. Mann,et al.  Fractals and related phenomena in nature , 2005 .

[3]  Przemyslaw Prusinkiewicz,et al.  The Algorithmic Beauty of Plants , 1990, The Virtual Laboratory.

[4]  N. Meyers,et al.  H = W. , 1964, Proceedings of the National Academy of Sciences of the United States of America.

[5]  Farhad Mavaddat,et al.  Data-Path Synthesis as Grammar Inference , 1992, Synthesis for Control Dominated Circuits.

[6]  A. Lindenmayer Developmental systems without cellular interactions, their languages and grammars. , 1971, Journal of theoretical biology.

[7]  Przemyslaw Prusinkiewcz,et al.  Koch curves as attractors and repellers , 1988, IEEE Computer Graphics and Applications.

[8]  M. Barnsley,et al.  Recurrent iterated function systems , 1989 .

[9]  강태원,et al.  [서평]「Chaos and Fractals : New Frontiers of Science」 , 1998 .

[10]  Michael F. Barnsley,et al.  Fractals everywhere , 1988 .

[11]  Grzegorz Rozenberg,et al.  Developmental systems with locally catenative formulas , 2004, Acta Informatica.

[12]  John Hart,et al.  The object instancing paradigm for linear fractal modeling , 1992 .

[13]  A. Lindenmayer Mathematical models for cellular interactions in development. I. Filaments with one-sided inputs. , 1968, Journal of theoretical biology.

[14]  Agnes Arber,et al.  The Natural Philosophy of Plant Form , 1971 .

[15]  G. Mitchison,et al.  Rule governing Cell Division in Anabaena , 1972, Nature.

[16]  M. Barnsley,et al.  Iterated function systems and the global construction of fractals , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[17]  Grzegorz Rozenberg,et al.  Developmental systems and languages , 1972, STOC.

[18]  Grzegorz Rozenberg,et al.  Description of developmental languages using recurrence systems , 2005, Mathematical systems theory.

[19]  Przemyslaw Prusinkiewicz,et al.  Graphical applications of L-systems , 1986 .

[20]  P. Prusinkiewicz,et al.  Language-Restricted Iterated Function Systems, Koch Constructions, and L-systems , 1994 .

[21]  Ron Goldman,et al.  Recursive turtle programs and iterated affine transformations , 2004, Comput. Graph..

[22]  C. Sparrow The Fractal Geometry of Nature , 1984 .