Affiliation:
1. Computer Graphics Project, Computer Division, Lucasfilm Ltd.
Abstract
Although fractal models of natural phenomena have received much attention recently, there are other models of complex natural objects which have been around longer in Computer Imagery but are not widely known. These are procedural models of plants and trees. An interesting class of these models is presented here which handles plant growth, sports an efficient data representation, and has a high “database amplification” factor. It is based on an extension of the well-known formal languages of symbol strings to the lesser-known formal languages of labeled graphs. It is so tempting to describe these plant models as “fractal” that the similarities of this class of models with fractal models are explored in an attempt at rapprochement. The models are not fractal so the common parts of fractal theory and plant theory are abstracted to form a class of objects, the
graftals
. This class may prove to be of great interest to the future of Computer Imagery. Determinism is shown to provide adequate complexity, whereas randomness is only convenient and often inefficient. Finally, a nonfractal, nongraftal family of trees by Bill Reeves is introduced to emphasize some of the paper's nongrammatical themes.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,General Computer Science
Reference23 articles.
1. Cook Rob Loren Carpenter Thomas Porter William Reeves David Salesin and Alvy Ray Smith Road to Point Reyes By the Lucasfilm Computer Graphics Project. Title page picture for SIGGRAPH '83 Proceedings. July 1983. Cook Rob Loren Carpenter Thomas Porter William Reeves David Salesin and Alvy Ray Smith Road to Point Reyes By the Lucasfilm Computer Graphics Project. Title page picture for SIGGRAPH '83 Proceedings. July 1983.
2. Ehrig Harmut M. Pfender and H. J. Schneider "Graph-Grammars: An Algebraic Approach " pp. 167-180 in Proceedings of 14th Annual Symposium on Switching & Automata Theory (October 1973). Now known as the Symposium on the Foundations of Computer Science. Ehrig Harmut M. Pfender and H. J. Schneider "Graph-Grammars: An Algebraic Approach " pp. 167-180 in Proceedings of 14th Annual Symposium on Switching & Automata Theory (October 1973). Now known as the Symposium on the Foundations of Computer Science.
3. Ehrig Harmut and H.-J. Kreowski "Parallel Graph Grammars " pp. 425-442 in Automata Languages Development ed. Aristid Lindenmayer and Grzegorz Rozenberg North-Holland Publishing Company Amsterdam/New York/Oxford (1976). Ehrig Harmut and H.-J. Kreowski "Parallel Graph Grammars " pp. 425-442 in Automata Languages Development ed. Aristid Lindenmayer and Grzegorz Rozenberg North-Holland Publishing Company Amsterdam/New York/Oxford (1976).
4. Ehrig Harmut and Grzegorz Rozenberg "Some Definitional Suggestions for Parallel Graph Grammars " pp. 443-468 in Automata Languages Development ed. Aristid Lindenmayer and Grzegorz Rozenberg North-Holland Publishing Company Amsterdam/New York/Oxford (1976). Ehrig Harmut and Grzegorz Rozenberg "Some Definitional Suggestions for Parallel Graph Grammars " pp. 443-468 in Automata Languages Development ed. Aristid Lindenmayer and Grzegorz Rozenberg North-Holland Publishing Company Amsterdam/New York/Oxford (1976).
Cited by
162 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献