Bounding ellipsoids for ray-fractal intersection
Author:
Open Access
- 1 July 1985
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGGRAPH Computer Graphics
- Vol. 19 (3) , 45-52
Abstract
Recently published papers have shown that, with appropriate intersection algorithms, the rendering of many procedural objects is possible with all the advantages offered by the ray-tracing techniques. In the case of stochastic surfaces, the intersection can be computed by a recursive subdivision technique. The efficiency of this algorithm depends essentially on the bounding volume whose size and shape are directly related to the stochastic characteristics of these surfaces. After a brief review of the rendering of stochastic surfaces and the bounding volume selection problem, two types of bounding volume are studied, describing how their intersection with a ray can be computed and how their size can be derived from the stochastic characteristics. The efficiency then, of these bounding volumes are compared.Keywords
This publication has 6 references indexed in Scilit:
- Using Stochastic Modeling for Texture GenerationIEEE Computer Graphics and Applications, 1984
- Improved Computational Methods for Ray TracingACM Transactions on Graphics, 1984
- A Testbed for Realistic Image SynthesisIEEE Computer Graphics and Applications, 1983
- New Techniques for Ray Tracing Procedurally Defined ObjectsACM Transactions on Graphics, 1983
- Technical correspondenceCommunications of the ACM, 1982
- Computer rendering of stochastic modelsCommunications of the ACM, 1982