Abstract
The historical constructions of fractals by Cantor, Sierpinski, von Koch, Peano, etc., have been labeled as ‘mathematical monsters’. Their purpose had been mainly to provide certain counterexamples, for example, showing that there are curves that go through all points in a square. Today a different point of view has emerged due to the ground-breaking achievements of Mandelbrot. Those strange creations from the turn of the century are anything but exceptional counterexamples; their features are in fact typical of nature. Consequently, fractals are becoming essential components in the modeling and simulation of nature. Certainly, there is a great difference between the basic fractals shown in this book and their counterparts in nature: mountains, rivers, trees, etc. Surely, the artificial fractal mountains produced today in computer graphics already look stunningly real. But on the other hand they still lack something we would certainly feel while actually camping in the real mountains. Maybe it is the (intentional) disregarding of all developmental processes in the fractal models which is one of the factors responsible for this shortcoming.
The development of an organism may [...] be considered as the execution of a ‘developmental program’ present in the fertilized egg. The cellularity of higher organisms and their common DNA components force us to consider developing organisms as dynamic collections of appropriately programmed finite automata. A central task of developmental biology is to discover the underlying algorithm from the course of development.
Aristid Lindenmayer and Grzegorz Rozenberg1
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Reference
In: Automata, Languages, Development, A. Lindenmayer, G. Rozenberg (eds. ), North-Holland, 1975.
K. Musgrave, C. Kolb and R. Mace, The synthesis and the rendering of eroded fractal terrain, SIGGRAPH ‘89, Computer Graphics 24 (1988).
D’Arcy Thompson, On Growth and Form, New Edition, Cambridge University Press, 1942.
A. Lindenmayer, Mathematical models for cellular interaction in development, Parts l and Il, Journal of Theoretical Biology 18 (1968) 280–315.
G. J. Mitchison and M. Wilcox, Rule governing cell division in anabaena, Nature 239 (1972) 110–111.
See P. Prusinkiewicz, A. Lindenmayer, J. Hanan, Developmental models of herbaceous plants for computer imagery purposes, Computer Graphics 22, 4 (1988) 141–150. Previous application of L-systems to image synthesis, pioneered by Alvy Ray Smith in 1978 used L-systems to generate abstract branching structures that did not correspond to the existing species. See A. R. Smith, Plants, fractals, and formal languages, Computer Graphics 18, 3 (1984) 1–10.
The relation between L-systems and IFSs was first studied in T. Bedford, Dynamics’ and dimension /or %rotaul recurrent sets, J. London Math. Soc. 33 (1986) 89–100. Another discussion more oriented toward formal languages is presented in P. Prusinkiewicz and M. Hammel, Automata, languages, and iterated function systems, in: Fractals Modeling in 3–11) Computer Graphics and Imaging, ACM SIGGRAPH ‘81 Course Notes C14 ( J. C. Hart, K. Musgrave, eds. ), 1991.
It is an interesting and open question whether one can construct such a curve with fewer transformations than five as used in figure 7.19. Note that the space-filling property again follows from the invariance of the initial square under the MRCM.
See C. Davis and D. E. Knuth, Number Representations and Dragon Curves,Journal of Recreational Mathematics 3 (1970) 66–81 and 133–149.
Also page 66 in B. B. Mandelbrot, The Fractal Geometry of Nature, Freeman, New York, 1982.
It was introduced in P. Prusinkiewicz, Graphical applications of L-systems, Proceedings of Graphics Interface ‘86, Kaufmann, 1986, 247–253.
See also P. Prusinkiewicz, J. Hanan, Lindenmayer Systems, Fractals and Plants, Vol. 79 of Lecture Notes on Biomathematics, Springer-Verlag, New York, 1989.
S. Papert, Mindstorms: Children, Computers, and Powerful Ideas, Basic Books, New York, 1980.
For a solution to this problem for a restricted class of L-systems see F. M. Dekking, Recurrent Sets, Advances in Mathematics 44, 1 (1982) 78–104.
D. Hilbert, Über die stetige Abbildung einer Linie auf ein Flächenstück, Mathematische Annalen 38 (1891) 459–460.
The original paper of Hilbert is reproduced in the figures 2.36 and 2.37 on pages 96–97 in chapter 2.
See P. Prusinkiewicz and A. Lindenmayer, The Algorithmic Beauty of Plants Springer-Verlag, New York, 1990. The figure 7.43 is also from this book.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer Science+Business Media New York
About this chapter
Cite this chapter
Peitgen, HO., Jürgens, H., Saupe, D. (1992). Recursive Structures: Growing of Fractals and Plants. In: Chaos and Fractals. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-4740-9_8
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4740-9_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-4742-3
Online ISBN: 978-1-4757-4740-9
eBook Packages: Springer Book Archive