This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids
April-June 1997 (vol. 3 no. 2)
pp. 142-157

AbstractLazy Sweep Ray Casting is a fast algorithm for rendering general irregular grids. It is based on the sweep-plane paradigm, and it is able to accelerate ray casting for rendering irregular grids, including disconnected and nonconvex (even with holes) unstructured irregular grids with a rendering cost that decreases as the "disconnectedness" decreases. The algorithm is carefully tailored to exploit spatial coherence even if the image resolution differs substantially from the object space resolution.

Lazy Sweep Ray Casting has several desirable properties, including its generality, (depth-sorting) accuracy, low memory consumption, speed, simplicity of implementation, and portability (e.g., no hardware dependencies).

We establish the practicality of our method through experimental results based on our implementation, which is shown to be substantially faster (by up to two orders of magnitude) than other algorithms implemented in software.

We also provide theoretical results, both lower and upper bounds, on the complexity of ray casting of irregular grids.

[1] P.K. Agarwal, M.J. Katz, and M. Sharir, "Computing Depth Orders and Related Problems," Proc. Fourth Scandinavian Workshop Algorithm Theory, pp. 1-12, Lecture Notes in Computer Science, vol. 824, Springer-Verlag, 1994.
[2] P.K. Agarwal and J. Matousek, "Ray Shooting and Parametric Search," SIAM J. Computing, vol. 22, no. 4, pp. 794-806, 1993.
[3] P.K. Agarwal and J. Matousek, "On Range Searching with SemiAlgebraic Sets," Discrete Computer Geometry, vol. 11, pp. 393-418, 1994.
[4] P.K. Agarwal and M. Sharir, "Applications of a New Partition Scheme," Discrete Computer Geometry, vol. 9, pp. 11-38, 1993.
[5] B. Chazelle, H. Edelsbrunner, L.J. Guibas, R. Pollack, R. Seidel, M. Sharir, and J. Snoeyink, "Counting and Cutting Cycles of Lines and Rods in Space," Computer Geometry Theory Applications, vol. 1, pp. 305-323, 1992.
[6] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGraw-Hill, 1990.
[7] M. de Berg, Ray Shooting, Depth Orders and Hidden Surface Removals.Berlin: Springer-Verlag, 1993.
[8] M. de Berg, D. Halperin, M. Overmars, J. Snoeyink, and M. van Kreveld, "Efficient Ray Shooting and Hidden Surface Removal," Algorithmica, vol. 12, pp. 30-53, 1994.
[9] M. de Berg, M. Overmars, and O. Schwarzkopf, "Computing and Verifying Depth Orders," SIAM J. Computing, vol. 23, pp. 437-446, Apr. 1994.
[10] D.P. Dobkin and M.J. Laszlo, "Primitives for the Manipulation of Three-Dimensional Subdivisions," Algorithmica, vol. 4, pp. 3-32, 1989.
[11] H. Edelsbrunner, "An Acyclicity Theorem for Cell Complexes in d Dimensions," Combinatorica, vol. 10, pp. 251-260, 1990.
[12] T. ${\rm Fr\ddot uhauf}$, "Raycasting of Nonregularly Structured Volume Data," Computer Graphics Forum (Eurographics '94), vol. 13, no. 3, 1994.
[13] H. Fuchs, Z. Kedem, and B. Naylor, "On Visible Surface Generation by a priori Tree Structures," Proc. ACM Siggraph, vol. 14, no. 3, pp. 124-133, 1980.
[14] M. Garrity, “Raytracing Irregular Volume,” Computer Graphics (Proc. 1990 ACM Workshop Volume Visualization), vol. 24, no. 2, pp. 35-40, 1990.
[15] C. Giertsen, "Volume Visualization of Sparse Irregular Meshes," IEEE Computer Graphics and Applications, vol. 12, no. 2, Mar. 1992, pp. 40-48.
[16] S. Hertel and K. Mehlhorn, "Fast Triangulation of the Plane with Respect to Simple Polygons," Information and Control, vol. 64, nos. 1-3, pp. 52-76, Jan. 1985.
[17] A.E. Kaufman et. al., "Research Issues in Volume Visualization," IEEE Computer Graphics and Applications, vol. 14, no. 2, pp. 63-67, Mar. 1994.
[18] M. Levoy, “Display of Surfaces from Volume Data,” IEEE Computer Graphics and Applications, vol. 8, no. 3, pp. 29-37, 1988.
[19] K. Ma, "Parallel Volume Rendering for Unstructured-Grid Data on Distributed Memory Machines," Proc. IEEE/ACM Parallel Rendering Symposium '95, ACM Press, New York, pp. 23-30.
[20] X. Mao, L. Hong, and A. Kaufman, “Splatting of Curvilinear Volumes,” IEEE Visualization '95 Proc., pp. 61-68, Oct. 1995.
[21] N. Max, "Optical Models for Direct Volume Rendering," IEEE Trans. Visualization and Computer Graphics, Vol. 1, No. 2, June 1995, pp. 99-108.
[22] N. Max, P. Hanrahan, and R. Crawfis, “Area and Volume Coherence for Efficient Visualization of 3D Scalar Functions,” Computer Graphics (Proc. 1990 ACM Workshop Volume Visualization), vol. 24, no. 2, pp. 27-33, 1990.
[23] J.S.B. Mitchell, D.M. Mount, and S. Suri, "Query-Sensitive Ray Shooting," Proc. 10th Ann. ACM Symp. Computational Geometry, pp. 359-368, June 1994. (To appear, Int'l J. Computational Geometry&Applications)
[24] G.M. Nielson, “Scattered Data Modeling,” IEEE CG&A, Vol. 13, No. 1, Jan. 1993, pp. 60-70.
[25] G.M. Nielson, T.A. Foley, B. Hamann, and D. Lane, "Visualizing and Modeling Scattered Multivariate Data," IEEE Computer Graphics&Applications, vol. 11, no. 3, pp.47-55, 1991.
[26] M. Paterson and F. Yao, “Efficient Binary Space Partitions for Hidden Surface Removal and Solid Modeling,” Discrete and Computational Geometry, vol. 5, no. 5, pp. 485-503, 1990.
[27] M. Pellegrini, "Ray Shooting on Triangles in 3-Space," Algorithmica, vol. 9, pp. 471-494, 1993.
[28] C.E. Prakash, "Parallel Voxelization Algorithms for Volume Rendering of Unstructured Grids," PhD thesis, Supercomputer Centre, Indian Inst. of Science, 1996.
[29] F.P. Preparata and M.I. Shamos, Computational Geometry. Springer-Verlag, 1985.
[30] S. Ramamoorthy and J. Wilhelms, “An Analysis of Approaches to Ray-Tracing Curvilinear Grids,” Technical Report UCSC-CRL-92-07, Univ. of California at Santa Cruz, 1992.
[31] H. Samet, The Design and Analysis of Spatial Data Structures. Addison-Wesley, 1990.
[32] W. Schroeder, K. Martin, and B. Lorensen, The Visualization Toolkit.Upper Saddle River, N.J.: Prentice Hall, 1996.
[33] G. Sakas and J. Hartig, "Interactive Visualization of Large Scalar Voxel Fields," A. Kaufman and E.G. Nielson, eds., IEEE Visualization '92 Proc., pp. 29-36,Boston, Mass., Oct. 1992.
[34] P. Shirley and A. Tuchman, “A Polygonal Approximation to Direct Scalar Volume Rendering,” Computer Graphics (Proc. 1990 ACM Workshop Volume Visualization), vol. 24, no. 2, pp. 63-69, 1990.
[35] C. Silva, Parallel Volume Rendering of Irregular Grids, doctoral dissertation, State University of New York at Stony Brook, Dept. of Computer Sci., 1996.
[36] C. Silva, J.S.B. Mitchell, and A.E. Kaufman, "Fast Rendering of Irregular Grids," in 1996 Symp. Volume Visualization, ACM Press, New York, pp. 15-22.
[37] D. Speray and S. Kennon, “Volume Probe: Interactive Data Exploration on Arbitrary Grids,” Computer Graphics, vol. 24, no. 5, pp. 5-12, 1990.
[38] C. Stein, B. Becker, and N. Max, “Sorting and Hardware Assisted Rendering for Volume Visualization,” Proc. 1994 ACM Symp. Volume Visualization, pp. 83-89, 1994.
[39] S. Uselton, "Volume Rendering for Computational Fluid Dynamics: Initial Results," Technical Report RNR-91-026, NASA Ames Research Center, 1991.
[40] A. Van Gelder and J. Wilhelms, “Rapid Exploration of Curvilinear Grids Using Direct Volume Rendering,” Proc. IEEE Visualization '93, pp. 70-77, 1993.
[41] J. Wilhelms, "Pursuing Interactive Visualization of Irregular Grids," Visual Computer, vol. 9, no. 8, 1993.
[42] J. Wilhelms, J. Challinger, N. Alper, S. Ramamoorthy, and A. Vaziri, “Direct Volume Rendering of Curvilinear Volumes,” Computer Graphics (Proc. 1990 ACM Workshop Volume Visualization), vol. 24, no. 2, pp. 41-48, 1990.
[43] J. Wilhelms and A. Van Gelder, "A Coherent Projection Approach for Direct Volume Rendering," Computer Graphics, vol. 25, no. 4, pp. 275-283, July 1991.
[44] J. Wilhelms, A. Van Gelder, P. Tarantino, and J. Gibbs, “Hierarchical and Parallelizable Direct Volume Rendering for Irregular and Multiple Grids,” Proc. IEEE Visualization '96, pp. 57-64, 1996.
[45] P. Williams, “Visibility Ordering Meshed Polyhedra,” ACM Trans. Graphics, vol. 11, no. 2, pp. 103-126, 1992.
[46] R. Yagel, "Volume Rendering Polyhedral Grids by Incremental Slicing," Technical Report OSU-CISRC-10/93-TR35, 1993.
[47] R. Yagel, D. Reed, A. Law, P.-W. Shih, and N. Shareef, "Hardware Assisted Volume Rendering of Unstructured Grids by Incremental Slicing," Proc. 1996 Symp. Volume Visualization, pp. 55-62 and p. 101, Oct. 1996.

Index Terms:
Volumetric data, irregular grids, volume rendering, sweep algorithms, ray tracing, computational geometry, scientific visualization.
Citation:
Claudio T. Silva, Joseph S.B. Mitchell, "The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids," IEEE Transactions on Visualization and Computer Graphics, vol. 3, no. 2, pp. 142-157, April-June 1997, doi:10.1109/2945.597797
Usage of this product signifies your acceptance of the Terms of Use.