Slice-Based Volume Rendering

A current goal in volume graphics is a volume rendering algorithm that provides an elegant and controllable tradeoff between image quality and rendering speed. In this report we propose a slice-based volume rendering algorithm which attempts to address this goal. We describe both the basic algorithm and several ways that it can operate in an incremental and an adaptive manner.

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

[2]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[3]  Henry Fuchs,et al.  Optimal surface reconstruction from planar contours , 1977, CACM.

[4]  G. Herman,et al.  Three-dimensional display of human organs from computed tomograms , 1979 .

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

[6]  Lee Westover,et al.  Footprint evaluation for volume rendering , 1990, SIGGRAPH.

[7]  T. Todd Elvins,et al.  A survey of algorithms for volume visualization , 1992, COMG.

[8]  Pat Hanrahan,et al.  Volume Rendering , 2020, Definitions.

[9]  Craig Upson,et al.  V-buffer: visible volume rendering , 1988, SIGGRAPH.

[10]  Eric Keppel,et al.  Approximating Complex Surfaces by Triangulation of Contour Lines , 1975, IBM J. Res. Dev..

[11]  Marc Levoy,et al.  Display of surfaces from volume data , 1988, IEEE Computer Graphics and Applications.

[12]  Arie E. Kaufman,et al.  Template‐Based Volume Viewing , 1992, Comput. Graph. Forum.

[13]  Peter Shirley,et al.  A polygonal approximation to direct scalar volume rendering , 1990, SIGGRAPH 1990.

[14]  Marc Levoy,et al.  Efficient ray tracing of volume data , 1990, TOGS.

[15]  Heang K. Tuy,et al.  Direct 2-D display of 3-D objects , 1984, IEEE Computer Graphics and Applications.