Subscribe
Issue No.08 - Aug. (2013 vol.19)
pp: 1307-1316
Wencheng Wang , State Key Lab. of Comput. Sci., Inst. of Software, Beijing, China
Guofu Xie , State Key Lab. of Comput. Sci., Inst. of Software, Beijing, China
ABSTRACT
Rendering multifragment effects using graphics processing units (GPUs) is attractive for high speed. However, the efficiency is seriously compromised, because ordering fragments on GPUs is not easy and the GPU's memory may not be large enough to store the whole scene geometry. Hitherto, existing methods have been unsuitable for large models or have required many passes for data transmission from CPU to GPU, resulting in a bottleneck for speedup. This paper presents a stream method for accurate rendering of multifragment effects. It decomposes the model into parts and manages these in an efficient manner, guaranteeing that the parts can easily be ordered with respect to any viewpoint, and that each part can be rendered correctly on the GPU. Thus, we can transmit the model data part by part, and once a part has been loaded onto the GPU, we immediately render it and composite its result with the results of the processed parts. In this way, we need only a single pass for data access with a very low bounded memory requirement. Moreover, we treat parts in packs for further acceleration. Results show that our method is much faster than existing methods and can easily handle large models of any size.
INDEX TERMS
Rendering (computer graphics), Slabs, Graphics processing units, Complexity theory, Data models, Ellipsoids, Data communication, accurate rendering, Multifragment effects, depth ordering, fixed amount of memory, large models
CITATION
Wencheng Wang, Guofu Xie, "Memory-Efficient Single-Pass GPU Rendering of Multifragment Effects", IEEE Transactions on Visualization & Computer Graphics, vol.19, no. 8, pp. 1307-1316, Aug. 2013, doi:10.1109/TVCG.2012.320
REFERENCES
 [1] C. Everitt, "Interactive Order-Independent Transparency," technical report, NVIDIA Corporation, 2001. [2] L. Bavoil and K. Myers, "Order Independent Transparency with Dual Depth Peeling," technical report, NVIDIA Corporation, 2008. [3] L. Bavoil, S.P. Callahan, A. Lefohn, J.L.D. Comba, and C.T. Silva, "Multi-Fragment Effects on the GPU Using the K-Buffer," Proc. Symp. Interactive 3D Graphics and Games, pp. 97-104, 2007. [4] F. Liu, M.C. Huang, X.H. Liu, and E.H. Wu, "Efficient Depth Peeling via Bucket Sort," Proc. Conf. High Performance Graphics, pp. 51-57, 2009. [5] F. Liu, M.C. Huang, X.H. Liu, and E.H. Wu, "Freepipe: Programmable Parallel Rendering Architecture for Efficient Multi-Fragment Effects," Proc. Symp. Interactive 3D Graphics and Games, pp. 75-82, 2010. [6] D. Wexler, L. Gritz, E. Enderton, and J. Rice, "GPU-Accelerated High-Quality Hidden Surface Removal," Proc. ACM SIGGRAPH/EUROGRAPHICS Conf. Graphics Hardware, pp. 7-14, 2005. [7] E. Catmull, "A Subdivision Algorithm for Computer Display of Curved Surfaces," PhD thesis, Dept. of Computer Science, Univ. of Utah, 1974. [8] L. Carpenter, "The A-Buffer, an Antialiased Hidden Surface Method," Computer Graphics, vol. 18, no. 3, pp. 103-108, 1984. [9] M. Wittenbrink, "R-Buffer: A Pointerless A-Buffer Hardware Architecture," Proc. ACM SIGGRAPH/EUROGRAPHICS Workshop Graphics Hardware, pp. 73-80, 2001. [10] W.R. Mark and K. Proudfoot, "The F-Buffer: A Rasterization-Order Fifo Buffer for Multi-Pass Rendering," Proc. ACM SIGGRAPH/EUROGRAPHICS Symp. Graphics Hardware, pp. 57-64, 2001. [11] K. Myers and L. Bavoil, "Stencil Routed A-Buffer," Proc. ACM SIGGRAPH, 2007. [12] P. Jouppi and F. Chang, "$z^3$ : An Economical Hardware Technique for High-Quality Antialiasing and Transparency," Proc. ACM SIGGRAPH/EUROGRAPHICS Workshop Graphics Hardware, pp. 85-93, 1999. [13] S.P. Callahan, M. Ikits, J.L.D. Comba, and C.T. Silva, "Hardware-Assisted Visibility Sorting for Unstructured Volume Rendering," IEEE Trans. Visualization and Computer Graphics, vol. 11, no. 3, pp. 285-295, May 2005. [14] A. Mammen, "Transparency and Antialiasing Algorithms Implemented with the Virtual Pixel Maps Technique," IEEE Computer Graphics and Applications, vol. 9, no. 4, pp. 43-55, July 1989. [15] B.Q. Liu, L.Y. Wei, and Y.-Q Xu, "Multi-Layer Depth Peeling via Fragment Sort," technical report, Microsoft Research Asia, 2006. [16] N. Carr, R. Měch, and G. Miller, "Coherent Layer Peeling for Transparent High-Depth-Complexity Scenes," Proc. ACM SIGGRAPH/EUROGRAPHICS Symp. Graphics Hardware, pp. 33-40, 2008. [17] N.K. Govindaraju, M. Henson, M.C. Lin, and D. Manocha, "Interactive Visibility Ordering and Transparency Computations among Geometric Primitives In Complex Environments," Proc. Symp. Interactive 3D Graphics and Games, pp. 49-56, 2005. [18] E. Eisemann and X. Décoret, "Fast Scene Voxelization and Applications," Proc. Symp. Interactive 3D Graphics and Games, pp. 71-78, 2006. [19] J.C. Yang, J. Hensley, H. Grün, and N. Thibieroz, "Real-Time Concurrent Linked List Construction on the GPU," Computer Graphics Forum, vol. 29, no. 4, pp. 1297-1304, 2010. [20] Y. Zhang and R. Pajarola, "Deferred Blending: Image Composition for Single-Pass Point Rendering," Computers and Graphics, vol. 31, no. 2, pp. 175-189, 2007. [21] T.Y. Kim and U. Neumann, "Opacity Shadow Maps," Proc. 12th Eurographics Workshop Rendering Techniques, pp. 177-182, 2001. [22] C. Yuksel and J. Keyser, "Deep Opacity Maps," Computer Graphics Forum, vol. 27, no. 2, pp. 675-680, 2008. [23] E. Enderton, E. Sintorn, P. Shirley, and D. Luebke, "Stochastic Transparency," Proc. Symp. Interactive 3D Graphics and Games, pp. 157-164, 2010. [24] J. Jansen and L. Bavoil, "Fourier Opacity Mapping," Proc. Symp. Interactive 3D Graphics and Games, pp. 165-172, 2010. [25] M. Salvi, J. Montgomery, and A. Lefohn, "Adaptive Transparency," Proc. ACM SIGGRAPH Symp. High Performance Graphics, pp. 119-126, 2011. [26] K. Chung and W. Wang, "Quick Collision Detection of Polytopes in Virtual Environments," Proc. ACM Symp. Virtual Reality Software and Technology, pp. 125-132, 1996. [27] W. Wang, Y.-K. Choi, B. Chan, M.-S. Kim, and J. Wang, "Efficient Collision Detection for Moving Ellipsoids Using Separating Planes," Computing, vol. 72, pp. 235-246, 2004. [28] P. Lindstrom, "Out-of-Core Simplification of Large Polygonal Models," Proc. ACM SIGGRAPH, pp. 259-262, 2000. [29] P. Williams, "Visibility-Order Meshed Polyhedra," ACM Trans. Graphics, vol. 11, no. 2, pp. 103-126, 1992. [30] C. Schlick, "An Inexpensive Brdf Model for Physically-Based Rendering," Computer Graphics Forum, vol. 13, no. 3, pp. 233-246, 1994. [31] A. Patney, S. Tzeng, and J.D. Owens, "Fragment-Parallel Composite and Filter," Computer Graphics Forum, vol. 29, no. 4, pp. 1251-1258, 2010.