The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Plants, fractals, and formal languages
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Fractal Geometry of Nature
Mandelbrot, B. B., & Wheeler, J. A. (1983) · American Journal of Physics · doi:10.1119/1.13295 · Cited by 21,832
Introduction to automata theory, languages and computation
(1981) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(81)90068-9 · Cited by 10,699
Particle Systems—a Technique for Modeling a Class of Fuzzy Objects
Reeves, W. T. (1983) · ACM Transactions on Graphics · doi:10.1145/357318.357320 · Cited by 1,078
Lindenmayer, A. (1968) · Journal of Theoretical Biology · doi:10.1016/0022-5193(68)90080-5 · Cited by 828
Computer rendering of stochastic models
Fournier, A., Fussell, D., & Carpenter, L. (1982) · Communications of the ACM · doi:10.1145/358523.358553 · Cited by 826
The Fractal Geometry of Nature.
Cannon, J. W., & Mandelbrot, B. B. (1984) · The American Mathematical Monthly · doi:10.2307/2323761 · Cited by 343
Cited by
Sims, K. (1994) · Proceedings of the 21st annual conference on Computer graphics and interactive techniques - SIGGRAPH '94 · doi:10.1145/192161.192167 · Cited by 1,005
Evolving 3D Morphology and Behavior by Competition
Sims, K. (1994) · Artificial Life · doi:10.1162/artl.1994.1.4.353 · Cited by 284
Artificial evolution for computer graphics
Sims, K. (1991) · Proceedings of the 18th annual conference on Computer graphics and interactive techniques · doi:10.1145/122718.122752 · Cited by 741
Parish, Y. I. H., & Müller, P. (2001) · Proceedings of the 28th annual conference on Computer graphics and interactive techniques · doi:10.1145/383259.383292 · Cited by 676
Muller, P. (2006) · ACM SIGGRAPH 2006 Courses on - SIGGRAPH '06 · doi:10.1145/1185657.1185716 · Cited by 663
Metadata
- Authors
- Smith, A. R.
- Venue
- Proceedings of the 11th annual conference on Computer graphics and interactive techniques
- Publisher
- ACM
- Published
- 1984-01
- Pages
- 1-10
- OpenAlex
- W2138181514
- Cited by
- 358
- References
- 6
- FWCI
- 5.88
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.