Managing geometric complexity with enhanced procedural models
- 31 August 1986
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGGRAPH Computer Graphics
- Vol. 20 (4), 189-195
- https://doi.org/10.1145/15886.15907
Abstract
We illustrate two enhancements to procedural geometric models which allow autonomous procedures to jointly satisfy mutual constraints. One of the techniques adds communications paths between procedures which may affect one another. Conflicts are resolved by modifying communicating procedures as they execute.The second technique is a generalization of widely used subdivision procedures. The termination test of typical subdivision methods is replaced with a "transition" test. The subdivision procedure is augmented with a "script" in the form of a state transition table which controls the procedures' response to external events as well as to the normal termination conditions.In the examples we show how effective these techniques are building complex geometric models with very sparse input.Keywords
This publication has 11 references indexed in Scilit:
- Approximate and probabilistic algorithms for shading and rendering structured particle systemsACM SIGGRAPH Computer Graphics, 1985
- An image synthesizerACM SIGGRAPH Computer Graphics, 1985
- Modeling the mighty mapleACM SIGGRAPH Computer Graphics, 1985
- Particle Systems—a Technique for Modeling a Class of Fuzzy ObjectsACM Transactions on Graphics, 1983
- A Generalization of Algebraic Surface DrawingACM Transactions on Graphics, 1982
- Computer animation with scripts and actorsACM SIGGRAPH Computer Graphics, 1982
- Computer rendering of stochastic modelsCommunications of the ACM, 1982
- Scan line methods for displaying parametrically defined surfacesCommunications of the ACM, 1980
- A fast scan-line algorithm for rendering parametric surfacesPublished by Association for Computing Machinery (ACM) ,1979
- An actor-based computer animation languagePublished by Association for Computing Machinery (ACM) ,1977