
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
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. 142157, AprilJune, 1997.  
BibTex  x  
@article{ 10.1109/2945.597797, author = {Claudio T. Silva and Joseph S.B. Mitchell}, title = {The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids}, journal ={IEEE Transactions on Visualization and Computer Graphics}, volume = {3}, number = {2}, issn = {10772626}, year = {1997}, pages = {142157}, doi = {http://doi.ieeecomputersociety.org/10.1109/2945.597797}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Visualization and Computer Graphics TI  The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids IS  2 SN  10772626 SP142 EP157 EPD  142157 A1  Claudio T. Silva, A1  Joseph S.B. Mitchell, PY  1997 KW  Volumetric data KW  irregular grids KW  volume rendering KW  sweep algorithms KW  ray tracing KW  computational geometry KW  scientific visualization. VL  3 JA  IEEE Transactions on Visualization and Computer Graphics ER   
Abstract—
Lazy Sweep Ray Casting has several desirable properties, including its generality, (depthsorting) 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. 112, Lecture Notes in Computer Science, vol. 824, SpringerVerlag, 1994.
[2] P.K. Agarwal and J. Matousek, "Ray Shooting and Parametric Search," SIAM J. Computing, vol. 22, no. 4, pp. 794806, 1993.
[3] P.K. Agarwal and J. Matousek, "On Range Searching with SemiAlgebraic Sets," Discrete Computer Geometry, vol. 11, pp. 393418, 1994.
[4] P.K. Agarwal and M. Sharir, "Applications of a New Partition Scheme," Discrete Computer Geometry, vol. 9, pp. 1138, 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. 305323, 1992.
[6] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGrawHill, 1990.
[7] M. de Berg, Ray Shooting, Depth Orders and Hidden Surface Removals.Berlin: SpringerVerlag, 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. 3053, 1994.
[9] M. de Berg, M. Overmars, and O. Schwarzkopf, "Computing and Verifying Depth Orders," SIAM J. Computing, vol. 23, pp. 437446, Apr. 1994.
[10] D.P. Dobkin and M.J. Laszlo, "Primitives for the Manipulation of ThreeDimensional Subdivisions," Algorithmica, vol. 4, pp. 332, 1989.
[11] H. Edelsbrunner, "An Acyclicity Theorem for Cell Complexes in d Dimensions," Combinatorica, vol. 10, pp. 251260, 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. 124133, 1980.
[14] M. Garrity, “Raytracing Irregular Volume,” Computer Graphics (Proc. 1990 ACM Workshop Volume Visualization), vol. 24, no. 2, pp. 3540, 1990.
[15] C. Giertsen, "Volume Visualization of Sparse Irregular Meshes," IEEE Computer Graphics and Applications, vol. 12, no. 2, Mar. 1992, pp. 4048.
[16] S. Hertel and K. Mehlhorn, "Fast Triangulation of the Plane with Respect to Simple Polygons," Information and Control, vol. 64, nos. 13, pp. 5276, Jan. 1985.
[17] A.E. Kaufman et. al., "Research Issues in Volume Visualization," IEEE Computer Graphics and Applications, vol. 14, no. 2, pp. 6367, Mar. 1994.
[18] M. Levoy, “Display of Surfaces from Volume Data,” IEEE Computer Graphics and Applications, vol. 8, no. 3, pp. 2937, 1988.
[19] K. Ma, "Parallel Volume Rendering for UnstructuredGrid Data on Distributed Memory Machines," Proc. IEEE/ACM Parallel Rendering Symposium '95, ACM Press, New York, pp. 2330.
[20] X. Mao, L. Hong, and A. Kaufman, “Splatting of Curvilinear Volumes,” IEEE Visualization '95 Proc., pp. 6168, Oct. 1995.
[21] N. Max, "Optical Models for Direct Volume Rendering," IEEE Trans. Visualization and Computer Graphics, Vol. 1, No. 2, June 1995, pp. 99108.
[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. 2733, 1990.
[23] J.S.B. Mitchell, D.M. Mount, and S. Suri, "QuerySensitive Ray Shooting," Proc. 10th Ann. ACM Symp. Computational Geometry, pp. 359368, 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. 6070.
[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.4755, 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. 485503, 1990.
[27] M. Pellegrini, "Ray Shooting on Triangles in 3Space," Algorithmica, vol. 9, pp. 471494, 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. SpringerVerlag, 1985.
[30] S. Ramamoorthy and J. Wilhelms, “An Analysis of Approaches to RayTracing Curvilinear Grids,” Technical Report UCSCCRL9207, Univ. of California at Santa Cruz, 1992.
[31] H. Samet, The Design and Analysis of Spatial Data Structures. AddisonWesley, 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. 2936,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. 6369, 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. 1522.
[37] D. Speray and S. Kennon, “Volume Probe: Interactive Data Exploration on Arbitrary Grids,” Computer Graphics, vol. 24, no. 5, pp. 512, 1990.
[38] C. Stein, B. Becker, and N. Max, “Sorting and Hardware Assisted Rendering for Volume Visualization,” Proc. 1994 ACM Symp. Volume Visualization, pp. 8389, 1994.
[39] S. Uselton, "Volume Rendering for Computational Fluid Dynamics: Initial Results," Technical Report RNR91026, 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. 7077, 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. 4148, 1990.
[43] J. Wilhelms and A. Van Gelder, "A Coherent Projection Approach for Direct Volume Rendering," Computer Graphics, vol. 25, no. 4, pp. 275283, 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. 5764, 1996.
[45] P. Williams, “Visibility Ordering Meshed Polyhedra,” ACM Trans. Graphics, vol. 11, no. 2, pp. 103126, 1992.
[46] R. Yagel, "Volume Rendering Polyhedral Grids by Incremental Slicing," Technical Report OSUCISRC10/93TR35, 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. 5562 and p. 101, Oct. 1996.