This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Out-Of-Core Rendering of Large, Unstructured Grids
July/August 2001 (vol. 21 no. 4)
pp. 42-50
The authors address the problem of rendering large unstructured volumetric grids on machines with limited memory. They present a set of techniques that can be used to render arbitrarily large data sets on machines with very little memory. The authors present results on rendering a few large data sets under different conditions (image resolutions, main memory configurations, and so on), and discuss the trade-offs of using the techniques presented in this article.

1. N. Max, "Optical Models for Direct Volume Rendering," IEEE Trans. Visualization and Computer Graphics, Vol. 1, No. 2, June 1995, pp. 99-108.
2. Y. Chiang, C.T. Silva, and W.J. Schroeder, “Interactive Out-of-Core Isosurface Extraction,” Proc. Visualization 1998, pp. 167-174, Oct. 1998.
3. S.-K. Ueng, K. Sikorski, and K.-L. Ma, "Out-of-Core Streamline Visualization on Large Unstructured Meshes," IEEE Trans. Visualization and Computer Graphics, vol. 3, no. 4, Dec. 1997, pp. 370-380.
4. P. Lindstrom, “Out-of-Core Simplification of Large Polygonal Models,” Proc. SIGGRAPH 2000, pp. 259-262, July 2000.
5. 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.
6. K.-L. Ma and T.W. Crockett, "A Scalable, Cell-Projection Volume Rendering Algorithm for 3D Unstructured Data," Proc. 1997 Symposium on Parallel Rendering, IEEE CS Press, Los Alamitos, Calif., 1997, pp. 95-104.
7. R. Farias, J. Mitchell, and C. Silva, "ZSweep: An Efficient and Exact Projection Algorithm for Unstructured Volume Rendering," Proc. 2000 Volume Visualization Symp., ACM Press, New York, 2000, pp. 91-99.
8. 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.
9. L. Carpenter, “The A-Buffer, an Antialiased Hidden Surface Method,” Computer Graphics, Proc. SIGGRAPH '84, vol. 18, no. 3, pp. 103-108, July 1984.
10. R. Farias and C. Silva, "Parallelizing the ZSweep Algorithm for Distributed-Shared Memory Architectures," to be published in Proc. Int'l Volume Graphics Workshop, 2001.
11. R. Farias, J.S. Mitchell, C.T. Silva, and B. Wylie, Time-Critical Rendering of Irregular Grids Proc. Sibgrapi 2000 (XIII Brazilian Symp. Computer Graphics and Image Processing), pp. 243-250, 2000.
1. M. Garrity, “Raytracing Irregular Volume,” Computer Graphics (Proc. 1990 ACM Workshop Volume Visualization), vol. 24, no. 2, pp. 35-40, 1990.
2. S. Uselton, Volume Rendering for Computational Fluid Dynamics: Initial Results, tech. report RNR-91-026, NASA Ames Research Center, Moffett Field, Calif., 1991.
3. P. Bunyk, A. Kaufman, and C. Silva, "Simple, Fast, and Robust Ray Casting of Irregular Grids," Scientific Visualization(Proc. Dagstuhl 97), IEEE CS Press, Los Alamitos, Calif., 2000, pp. 30-36.
4. C. Yang, T. Mitra, and T. Chiueh, On-the-Fly Rendering of Losslessly Compressed Irregular Volume Data Proc. IEEE Visualization 2000, T. Ertl, B. Hamann, and A. Varshney, eds., pp. 101-108, 2000.
5. L. Hong and A. Kaufman, “Accelerated Ray-Casting for Curvilinear Volumes,” Proc. IEEE Visualization '98, pp. 247-253, 1998.
6. 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.
7. C. Silva and J. Mitchell, “The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids,” IEEE Trans. Visualization and Computer Graphics, vol. 3, no. 2, pp. 142-157, June 1997.
8. C. Giertsen, "Volume Visualization of Sparse Irregular Meshes," IEEE Computer Graphics and Applications, vol. 12, no. 2, Mar. 1992, pp. 40-48.
9. R. Westermann and T. Ertl, "The VSbuffer: Visibility Ordering of Unstructured Volume Primitives By Polygon Drawing," Proc. IEEE Visualization 97, ACM Press, New York, 1997, pp. 35-42.
10. R. Farias, J. Mitchell, and C. Silva, "ZSweep: An Efficient and Exact Projection Algorithm for Unstructured Volume Rendering," Proc. 2000 Volume Visualization Symp., ACM Press, New York, 2000, pp. 91-99.
11. 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.
12. P. Williams, “Visibility Ordering Meshed Polyhedra,” ACM Trans. Graphics, vol. 11, no. 2, pp. 103-126, 1992.
13. 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.
14. 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.
15. 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.
16. J. Comba et al., "Fast Polyhedral Cell Sorting for Interactive Rendering of Unstructured Grids," Computer Graphics Forum, vol. 18, no. 3, Sept. 1999, pp. 369-376.
17. 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.
18. K.-L. Ma and T.W. Crockett, "A Scalable, Cell-Projection Volume Rendering Algorithm for 3D Unstructured Data," Proc. 1997 Symposium on Parallel Rendering, IEEE CS Press, Los Alamitos, Calif., 1997, pp. 95-104.
19. J. Abello and J. Vitter, External Memory Algorithms, American Mathematical Soc., Providence, R.I., 1999.
20. M.B. Cox and D. Ellsworth, "Application-Controlled Demand Paging for Out-of-Core Visualization," Proc. Visualization 97, ACM Press, New York, Oct. 1997, pp. 235-244.
21. S. Leutenegger and K.-L. Ma, "Fast Retrieval of Disk-Resident Unstructured Volume Data for Visualization," External Memory Algorithms and Visualization, Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) Book Series, vol. 50, American Mathematical Soc., Providence, R.I., 1999.
22. A. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD Conf. Management of Data, 1984.
23. S.-K. Ueng, K. Sikorski, and K.-L. Ma, "Out-of-Core Streamline Visualization on Large Unstructured Meshes," IEEE Trans. Visualization and Computer Graphics, vol. 3, no. 4, Dec. 1997, pp. 370-380.
24. H.-W. Shen, L. Chiang, and K.-L. Ma, “A Fast Volume Rendering Algorithm for Time-Varying Field Using a Time-Space Partitioning (TSP) Tree,” Proc. Visualization '99, pp. 371-377, 1999.
25. P.M. Sutton and C.D. Hansen, Accelerated Isosurface Extraction in Time-Varying Fields IEEE Trans. Visualization and Computer Graphics, vol. 6, no. 2, pp. 98-107, Apr.-June 2000.
26. Y. Chiang and C.T. Silva, I/O Optimal Isosurface Extraction Proc. IEEE Visualization '97, R. Yagel and H. Hagen, eds., 1997.
27. Y. Chiang, C.T. Silva, and W.J. Schroeder, “Interactive Out-of-Core Isosurface Extraction,” Proc. Visualization 1998, pp. 167-174, Oct. 1998.
28. P. Lindstrom, “Out-of-Core Simplification of Large Polygonal Models,” Proc. SIGGRAPH 2000, pp. 259-262, July 2000.
29. J. El-Sana and Y.-J. Chiang, "External Memory View-Dependent Simplification," Computer Graphics Forum, vol. 19, no. 3, Aug. 2000, pp. C-139-C-150.

Citation:
Ricardo Farias, Cláudio T. Silva, "Out-Of-Core Rendering of Large, Unstructured Grids," IEEE Computer Graphics and Applications, vol. 21, no. 4, pp. 42-50, July-Aug. 2001, doi:10.1109/38.933523
Usage of this product signifies your acceptance of the Terms of Use.