Abstract
Computer simulation of branching patterns has a relatively long history. The first model was proposed by Ulam [149], (see also [138, pages 127–131]), and employed the concept of cellular automata that had been developed earlier by von Neumann and Ulam [156]. The branching pattern is created iteratively, starting with a single colored cell in a triangular grid, then coloring cells that touch one and only one vertex of a cell colored in the previous iteration step.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Prusinkiewicz, P., Lindenmayer, A. (1990). Modeling of trees. In: The Algorithmic Beauty of Plants. The Virtual Laboratory. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-8476-2_2
Download citation
DOI: https://doi.org/10.1007/978-1-4613-8476-2_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-94676-4
Online ISBN: 978-1-4613-8476-2
eBook Packages: Springer Book Archive