|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| James T. Klosowski, Cláudio T. Silva, "Efficient Conservative Visibility Culling Using the Prioritized-Layered Projection Algorithm," IEEE Transactions on Visualization and Computer Graphics, vol. 7, no. 4, pp. 365-379, October-December, 2001. | |||
| BibTex | x | ||
| @article{ 10.1109/2945.965350, author = {James T. Klosowski and Cláudio T. Silva}, title = {Efficient Conservative Visibility Culling Using the Prioritized-Layered Projection Algorithm}, journal ={IEEE Transactions on Visualization and Computer Graphics}, volume = {7}, number = {4}, issn = {1077-2626}, year = {2001}, pages = {365-379}, doi = {http://doi.ieeecomputersociety.org/10.1109/2945.965350}, 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 - Efficient Conservative Visibility Culling Using the Prioritized-Layered Projection Algorithm IS - 4 SN - 1077-2626 SP365 EP379 EPD - 365-379 A1 - James T. Klosowski, A1 - Cláudio T. Silva, PY - 2001 KW - Conservative visibility KW - occlusion culling KW - interactive rendering. VL - 7 JA - IEEE Transactions on Visualization and Computer Graphics ER - | |||
Abstract—We propose a novel conservative visibility culling technique based on the Prioritized-Layered Projection (PLP) algorithm. PLP is a time-critical rendering technique that computes, for a given viewpoint, a partially correct image by rendering only a subset of the geometric primitives, those that PLP determines to be most likely visible. Our new algorithm builds on PLP and provides an efficient way of finding the remaining visible primitives. We do this by adding a second phase to PLP which uses image-space techniques for determining the visibility status of the remaining geometry. Another contribution of our work is to show how to efficiently implement such image-space visibility queries using currently available OpenGL hardware and extensions. We report on the implementation of our techniques on several graphics architectures, analyze their complexity, and discuss a possible hardware extension that has the potential to further increase performance.
[1] OpenGL histogram documentation,http://www.opengl.org/developers/documentation/ Version1.2/1.2specs-histogram.txt , 1997.
[2] L. Alonso and N. Holzschuch, “Using Graphics Hardware to Speed-Up Your Visibility Queries,” J. Graphics Tools, to appear.
[3] D. Bartz, M. Meißner, and T. Hüttner, “Extending Graphics Hardware for Occlusion Queries in OpenGL,” Proc. 1998 SIGGRAPH/Eurographics Workshop Graphics Hardware, pp. 97-104, Aug. 1998.
[4] D. Bartz, M. Meißner, and T. Hüttner, “OpenGL-Assisted Occlusion Culling for Large Polygonal Models,” Computers&Graphics, vol. 23, no. 5, pp. 667-679, Oct. 1999.
[5] F. Bernardini, J.T. Klosowski, and J. El-Sana, “Directional Discretized Occluders for Accelerated Occlusion Culling,” Computer Graphics Forum, vol. 19, no. 3, pp. 507-516, Aug. 2000.
[6] Y. Chrysanthou, D. Cohen-Or, and D. Lischinski, “Fast Approximate Quantitative Visibility for Complex Scenes,” Proc. Computer Graphics Int'l '98, pp. 220-229, June 1998.
[7] D. Cohen-Or, Y. Chrysanthou, and C. Silva, “A Survey of Visibility for Walkthrough Applications,” Submitted for publication, 2000. Also in “Visibility, Problems, Techniques, and Applications,” ACM SIGGRAPH 2000 Course #4, 2000.
[8] D. Cohen-Or, G. Fibich, D. Halperin, and E. Zadicario, “Conservative Visibility and Strong Occlusion for Viewspace Partitioning of Densely Occluded Scenes,” Computer Graphics Forum, vol. 17, no. 3, pp. 243-254, 1998.
[9] R. Cunniff, “Visualize fx Graphics Scalable Architecture,” Hot 3D Proc., Graphics Hardware Workshop 2000, Aug. 2000.
[10] F. Durand, “3D Visibility: Analytical Study and Applications,” PhD thesis, UniversitéJoseph Fourier, Grenoble, France, July 1999.
[11] F. Durand, G. Drettakis, J. Thollot, and C. Puech, “Conservative Visibility Preprocessing Using Extended Projections,” Proc. SIGGRAPH 2000, pp. 239-248, July 2000.
[12] 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.
[13] N. Greene, “Occlusion Culling with Optimized Hierarchical Buffering,” Proc. ACM SIGGRAPH '99 Sketches and Applications, p. 261, Aug. 1999.
[14] N. Greene and M. Kass, "Hierarchical Z-Buffer Visibility," Computer Graphics Proc. Ann. Conf. Series, pp. 231-240, 1993.
[15] L. Hong, S. Muraki, A. Kaufman, D. Bartz, and T. He, "Virtual Voyage: Interactive Navigation In The Human Colon," Computer Graphics, pp. 27-34, Aug. 1997. ACM/SIGGRAPH Press.
[16] J.T. Klosowski and C.T. Silva, Rendering on a Budget: A Framework for Time-Critical Rendering Proc. IEEE Visualization '99, pp. 115-122, Oct. 1999.
[17] J.T. Klosowski and C.T. Silva, The Prioritized-Layered Projection Algorithm for Visible Set Estimation IEEE Trans. Visualization and Computer Graphics, vol. 6, no. 2, pp. 108-123, Apr.-June 2000.
[18] V. Koltun, Y. Chrysanthou, and D. Cohen-Or, “Virtual Occluders: An Efficient Intermediate PVS Representation,” Rendering Techniques 2000: Proc. 11th Eurographics Workshop Rendering, pp. 59-70, June 2000.
[19] D. Luebke and C. Georges, "Portals and Mirrors: Simple, Fast Evaluation of Potentially Visible Sets," Proc. 1995 Symp. Interactive 3D Graphics, pp. 105-106, 1995.
[20] D. Meagher, “Efficient Synthetic Image Generation of Arbitrary 3-D Objects,” Proc. IEEE Conf. Pattern Recognition and Image Processing, pp. 473-478, June 1982.
[21] S. Morein, “ATI Radeon Hyper-Z Technology,” Hot 3D Proc., Graphics Hardware Workshop 2000, Aug. 2000.
[22] B.F. Naylor, "Partitioning Tree Image Representation and Generation from 3D Geometric Models," Proc. Graphics Interface '92, pp. 201-212,Vancouver, May 1992.
[23] C. Saona-Vazquez, I. Navazo, and P. Brunet, “The Visibility Octree: A Data Structure for 3D Navigation,” Computers and Graphics, vol. 23, no. 5, pp. 635-643, 1999.
[24] G. Schaufler, J. Dorsey, X. Decoret, and F.X. Sillion, “Conservative Volumetric Visibility with Occluder Fusion,” Proc. SIGGRAPH 2000, pp. 229-238, 2000.
[25] N. Scott, D. Olsen, and E. Gannet, “An Overview of the Visualize fx Graphics Accelerator Hardware,” Hewlett-Packard J., pp. 28-34, May 1998.
[26] K. Severson, “VISUALIZE Workstation Graphics for Windows NT,” HP product literature, 1999.
[27] Silicon Graphics, Inc., “SGI Visual Workstation OpenGL Programming Guide for Windows NT,” Document Number 007-3876-001,https://www.sgi.com/developers/nt/sdk/files OpenGLEXT.pdf, 1999.
[28] S. Teller and C.H. Sequin, "Visibility Preprocessing for Interactive Walkthroughs," Computer Graphics (Proc. Siggraph '91), vol. 25, no. 4, pp. 61-69, 1991.
[29] R. Westermann, O. Sommer, and T. Ertl, “Decoupling Polygon Rendering from Geometry Using Rasterization Hardware,” unpublished manuscript, 1999.
[30] P. Wonka and D. Schmalsteig, “Occluder Shadows for Fast Walkthroughs of Urban Environments,” Computer Graphics Forum, vol. 18, no. 3, pp. 51-60, Sept. 1999.
[31] P. Wonka, M. Wimmer, and D. Schmalstieg, “Visibility Preprocessing with Occluder Fusion for Urban Walkthroughs,” Rendering Techniques 2000: Proc. 11th Eurographics Workshop Rendering, pp. 71-82, June 2000.
[32] F. Xie and M. Shantz, “Adaptive Hierarchical Visibility in a Tiled Architecture,” Proc. 1999 SIGGRAPH/Eurographics Workshop Graphics Hardware, pp. 75-84, Aug. 1998.
[33] H. Zhang, D. Manocha, T. Hudson, and K.E. Hoff III, "Visibility Culling Using Hierarchical Occlusion Maps," Proc. Conf. SIGGRAPH '97, pp. 77-88,Los Angeles, ACM Computer Graphics Ann. Conf. Series, Aug. 1997, .