Fast Volume Rendering Using a Spherical Index Method for Shading

Abstract:

Volume rendering can be used to exhibit the shape and volumetric properties of 3-D objects. However, it requires a considerable amount of time to process the large volume of data. In this article we present a speed-up method by pre-computing some data of the shading model. We index voxel surface normal by and in spherical coordinate system. Each voxel surface normal is pre-computed and stored in array of values [ ]. Some values of the shading model related to voxel surface normal and light vector are also stored. Each rendering we only need updating these values for shading calculation. We found that our speed-up method can reduce about one fourth of computing time but need less additional memory to store surface normal using this spherical index method.

• Periodical: Advanced Engineering Forum (Volumes 2-3)
• Pages: 567-572
• DOI: https://doi.org/10.4028/www.scientific.net/AEF.2-3.567
• Online since: December 2011
• Authors: Yu Wang, Hong Wang, Lu Huang
• Keywords: Shading Model, Surface Normal, Volume Rendering

References

[1] A. Kaufman (eds. ). Volume visualization. IEEE Computer Society Press, (1991).

[2] T. S. Yoo, U. Neumann, H. Fuchs, S. M. Pizer, T. Cullip, J. Rhoades, and R. Whitaker. Direct visualization of volume data. IEEE Computer Graphics & Applications, 12: 63–71, (1992).

DOI: 10.1109/38.144828

[3] J. P. Singh, A. Gupta, and M. Levoy. Parallel visualization algorithms: Performance and architectural implications. Computer, 27: 45–55, (1994).

DOI: 10.1109/2.299410

[4] C. M. Wittenbrink and A. K. Somani. Permutation warping for data parallel volume rendering. InProceedings of the 1993 Parallel Rendering Symposium, p.57–60. San Jose, October (1993).

DOI: 10.1109/prs.1993.586086

[5] Hu Ying, Hou Yue，Xu Xin-he. Fast Volume Rendering for Medical Image[C], Proceedings of XI International Congress for Stereology, Beijin, Nov (2003).

[6] A. S. Glassner. Space subdivision for fast ray tracing. IEEE Computer Graphics and pplications, 4(10): 15–22, (1984).

DOI: 10.1109/mcg.1984.6429331

[7] J. Arvo and D. Kirk. A survey of ray tracing acceleration techniques. In Andrew S. Glassner, ditor, An Introduction to Ray Tracing, pages 201–262. Academic Press, London, (1989).

[8] V. Havran. Heuristic Ray Shooting Algorithms. Czech Technical University, Ph.D. dissertation, (2001).

[9] M. Ohta and M. Maekawa. Ray coherence theorem and constant time ray tracing algorithm. In T. L. Kunii, editor, Computer Graphics 1987. Proc. CG International '87, pages 303–314, (1987).

DOI: 10.1007/978-4-431-68057-4_19

[10] T. Horv´ath, P. M´arton, G. Risztics, and L. Szirmay-Kalos. Ray coherence between sphere and a convex polyhedron. Computer Graphics Forum, 2(2): 163–172, (1992).

DOI: 10.1111/1467-8659.1120163

[11] G. M´arton. Acceleration of ray tracing via voronoidiagrams. In Alan W. Paeth, editor, Graphics Gems V, pages 268–284. Academic Press, Boston, (1995).

[12] P. Bui-Tuong. Illumination for Computer-Generated Pictures. CACM, June 1975, pages 311-317.