Visibility Sampling on GPU and Applications

In this paper, we show how recent GPUs can be used to very efficiently and conveniently sample the visibility between two surfaces, given a set of occluding triangles. We use bitwise arithmetics to evaluate, encode, and combine the samples blocked by each triangle. In particular, the number of operations is almost independent of the number of samples. Our method requires no CPU/GPU transfers, is fully implemented as geometric, vertex and fragment shaders, and thus does not impose to modify the way the geometry is sent to the graphics card. We finally present applications to soft shadows, and visibility analysis for level design.

[1]  Michael Wimmer,et al.  Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful , 2004, Comput. Graph. Forum.

[2]  Mark J. Kilgard,et al.  Improving Shadows and Reflections via the Stencil Buffer , 1999 .

[3]  Paul S. Heckbert,et al.  Simulating Soft Shadows with Graphics Hardware , 1997 .

[4]  Charles D. Hansen,et al.  Soft Shadow Maps: Efficient Sampling of Light Source Visibility , 2006, Comput. Graph. Forum.

[5]  Shaun Nirenstein,et al.  A low dimensional framework for exact polygon-to-polygon occlusion queries , 2005, EGSR '05.

[6]  Carlos Andújar,et al.  Integrating Occlusion Culling and Levels of Detail through Hardly‐Visible Sets , 2000, Comput. Graph. Forum.

[7]  Bernard Péroche,et al.  Non-interleaved deferred shading of interleaved sample patterns , 2006, GH '06.

[8]  Elmar Eisemann,et al.  Fast scene voxelization and applications , 2006, I3D '06.

[9]  Lilian Aveneau,et al.  Coherent and Exact Polygon-to-Polygon Visibility , 2005, WSCG.

[10]  Edwin H. Blake,et al.  Exact From-Region Visibility Culling , 2002, Rendering Techniques.

[11]  F. Durand,et al.  A frequency analysis of light transport , 2005, ACM Trans. Graph..

[12]  Claude Puech,et al.  Radiosity and global illumination , 1994 .

[13]  Elmar Eisemann,et al.  Plausible Image Based Soft Shadows Using Occlusion Textures , 2006, 2006 19th Brazilian Symposium on Computer Graphics and Image Processing.

[14]  Jaakko Lehtinen,et al.  Hemispherical Rasterization for Self-Shadowing of Dynamic Objects , 2004, Rendering Techniques.

[15]  Michael Wimmer,et al.  Visibility Preprocessing with Occluder Fusion for Urban Walkthroughs , 2000, Rendering Techniques.

[16]  Michael Wimmer,et al.  Guided visibility sampling , 2006, ACM Trans. Graph..

[17]  Tomas Akenine-Möller,et al.  An optimized soft shadow volume algorithm with real-time performance , 2003, HWWS '03.

[18]  Timo Aila,et al.  Hierarchical Penumbra Casting , 2005, Comput. Graph. Forum.

[19]  Joëlle Thollot,et al.  Conservative visibility preprocessing using extended projections , 2000, SIGGRAPH.

[20]  Timo Aila,et al.  dPVS: an occlusion culling system for massive dynamic environments , 2004, IEEE Computer Graphics and Applications.

[21]  Richard O. Duda,et al.  Use of the Hough transformation to detect lines and curves in pictures , 1972, CACM.

[22]  François X. Sillion,et al.  Erosion Based Visibility Preprocessing , 2003, Rendering Techniques.

[23]  Aaron Knoll,et al.  Ray tracing animated scenes using coherent grid traversal , 2006, SIGGRAPH 2006.

[24]  Beverly Sackler,et al.  Ray Space Factorization for From-Region Visibility , 2002 .

[25]  Frédo Durand,et al.  A frequency analysis of light transport , 2005, SIGGRAPH '05.

[26]  Daniel Cohen-Or,et al.  Ray space factorization for from-region visibility , 2003, ACM Trans. Graph..

[27]  Frédo Durand,et al.  A Survey of Visibility for Walkthrough Applications , 2003, IEEE Trans. Vis. Comput. Graph..

[28]  James F. Blinn,et al.  Me and My (Fake) Shadow , 1988 .

[29]  Ingo Wald,et al.  Ray tracing animated scenes using coherent grid traversal , 2006, ACM Trans. Graph..

[30]  Michael Wimmer,et al.  Guided visibility sampling , 2006, SIGGRAPH 2006.