Ray tracing CSG trees using the Sticks representation scheme

Abstract A fast ray tracing algorithm of CSG tree is presented. The algorithm uses an adaptive space subdivisions approach, based on the conversion of the objects of the scene into the volumetric Sticks representation scheme. This conversion scheme, which requires O(kn2) memory space to represent data in a n3 grid, makes it possible either to obtain very fast low-quality frontal orthographic projections, or to produce a high-quality rendering of the scene in time less than that needed by classical ray tracing and nearly independent of the number of objects in the scene. Furthermore, the characteristics of the Sticks scheme can be exploited to compute geometric or topological properties of the represented objects. Comparative analyses between the Sticks representation scheme and classical space subdivision schemes and between our Sticksbased ray tracing and classical algorithms are presented.

[1]  Samuel M. Goldwasser.  A generalized object display processor architecture , 1984, IEEE Computer Graphics and Applications.

[2]  Chris L. Jackins,et al.  Oct-trees and their use in representing three-dimensional objects , 1980 .

[3]  Doctor,et al.  Display Techniques for Octree-Encoded Objects , 1981, IEEE Computer Graphics and Applications.

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

[5]  D. Jackél,et al.  The Graphics PARCUM * System: A 3D Memory Based Computer Architecture for Processing and Display of Solid Models , 1985, Comput. Graph. Forum.

[6]  Jack Bresenham,et al.  Algorithm for computer control of a digital plotter , 1965, IBM Syst. J..

[7]  Arie E. Kaufman,et al.  CUBE — An Architecture Based on a 3D Voxel Map , 1988 .

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

[9]  ARISTIDES A. G. REQUICHA,et al.  Representations for Rigid Solids: Theory, Methods, and Systems , 1980, CSUR.

[10]  Arie E. Kaufman,et al.  Memory and processing architecture for 3D voxel-based imagery , 1988, IEEE Computer Graphics and Applications.

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

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

[13]  Mark A. Z. Dippé,et al.  An adaptive subdivision algorithm and parallel architecture for realistic image synthesis , 1984, SIGGRAPH.

[14]  Takayuki Tanaka,et al.  ARTS: Accelerated Ray-Tracing System , 1986, IEEE Computer Graphics and Applications.

[15]  Andries van Dam.  PHIGS+ functional description revision , 1988, SIGGRAPH 1988.

[16]  Scott D. Roth,et al.  Ray casting for modeling solids , 1982, Comput. Graph. Image Process..

[17]  Jack Bresenham,et al.  A linear algorithm for incremental digital display of circular arcs , 1977, CACM.

[18]  Yves Duthen,et al.  VOXAR: A Tridimensional Architecture for Fast Realistic Image Synthesis , 1988 .

[19]  Charles R. Dyer.  The space efficiency of quadtrees , 1982, Comput. Graph. Image Process..