Efficient traversal of well-behaved hierarchical trees of extents for ray-tracing complex scenes

Traversal of hierarchial trees of extents (HTE) requires computation of intersections between rays and bounding volumes whose faces are parallel to the cartesian axes. By redefining the HTE so that nonoverlapping bounding volumes are generated, a well-behaved data structure is obtained in which “geometrical coherence” is applied to speed up its traversal. We distinguish two types of bounding volumes: internal boxes contain the ray's origin whileexternal bounding volumes do not contain the ray's origin. To traverse the HTE, we look first to polygons in the internal bounding volumes and deal with external boxes only when no ray-polygon intersection is found in internal nodes. As external nodes in the HTE define pruned subtrees of external bounding volumes, geometrical characteristics of the boxes are exploited for HTE traversal. A coding scheme allows a 6-bit code to determine which faces of a bounding volume need to be tested for intersection. Also, our well-behaved HTE allows for reuse of intersection points at lower levels of the tree.

[1]  Isaac D. Scherson,et al.  Sequential and parallel algorithms for ray tracing complex scenes , 1988 .

[2]  Frederik W. Jansen,et al.  Data structures for ray tracing , 1986 .

[3]  Robert L. Cook,et al.  Distributed ray tracing , 1984, SIGGRAPH.

[4]  Arthur Appel,et al.  Some techniques for shading machine renderings of solids , 1968, AFIPS Spring Joint Computing Conference.

[5]  Andrew S. Glassner,et al.  Space subdivision for fast ray tracing , 1984, IEEE Computer Graphics and Applications.

[6]  Andrew S. Glassner,et al.  Spacetime ray tracing for animation , 1988, IEEE Computer Graphics and Applications.

[7]  Isaac D. Scherson,et al.  Data structures and the time complexity of ray tracing , 2005, The Visual Computer.

[8]  Turner Whitted,et al.  A 3-dimensional representation for fast rendering of complex scenes , 1980, SIGGRAPH '80.

[9]  Donald P. Greenberg,et al.  Improved Computational Methods for Ray Tracing , 1984, TOGS.

[10]  Franklin C. Crow,et al.  The Origins of the Teapot , 1987, IEEE Computer Graphics and Applications.

[11]  James D. Foley,et al.  Fundamentals of interactive computer graphics , 1982 .

[12]  John Salmon,et al.  Automatic Creation of Object Hierarchies for Ray Tracing , 1987, IEEE Computer Graphics and Applications.

[13]  Roman Kuchkuda,et al.  An introduction to ray tracing , 1993, Comput. Graph..

[14]  Bui Tuong Phong Illumination for computer generated pictures , 1975, Commun. ACM.

[15]  Hanan Samet,et al.  Computing Geometric Properties of Images Represented by Linear Quadtrees , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  Hanan Samet,et al.  Hierarchical data structures and algorithms for computer graphics. I. Fundamentals , 1988, IEEE Computer Graphics and Applications.

[17]  David F. Rogers,et al.  Procedural Elements for Computer Graphics , 1984 .

[18]  Rae A. Earnshaw,et al.  Theoretical Foundations of Computer Graphics and CAD , 1988, NATO ASI Series.

[19]  L. R. A. Kessener,et al.  Data structures for raster graphics : proceedings of a workshop held at Steensel, the Netherlands, June 24-28, 1985 , 1986 .

[20]  Michael R. Kaplan,et al.  The Use of Spatial Coherence in Ray Tracing , 1987 .

[21]  Hanan Samet,et al.  Hierarchical data structures and algorithms for computer graphics. II. Applications , 1988, IEEE Computer Graphics and Applications.

[22]  John Amanatides,et al.  Ray tracing with cones , 1984, SIGGRAPH.

[23]  Turner Whitted,et al.  An improved illumination model for shaded display , 1979, CACM.

[24]  James Arvo,et al.  Fast ray tracing by ray classification , 1987, SIGGRAPH '87.

[25]  Ivan E. Sutherland,et al.  Reentrant polygon clipping , 1974, Commun. ACM.

[26]  Thomas W. Calvert,et al.  Multiprocessor experiments for high-speed ray tracing , 1988, TOGS.

[27]  James T. Kajiya,et al.  Ray tracing complex scenes , 1986, SIGGRAPH.

[28]  Isaac D. Scherson,et al.  Multiprocessing for ray tracing: a hierarchical self-balancing approach , 2005, The Visual Computer.

[29]  Hiroshi Deguchi,et al.  A tree-structured parallel processing system for image generation by ray tracing , 1986, Systems and Computers in Japan.

[30]  Robert L. Cook,et al.  A Reflectance Model for Computer Graphics , 1987, TOGS.

[31]  R. Sedgewick,et al.  Algorithms (2nd ed.) , 1988 .