Aggressive region-based visibility computation using importance sampling

We present an aggressive region-based visibility sampling algorithm for general 3D scenes. The visibility portal in the scene is a cue for guiding the visibility sampling. Our algorithm extends the image space sampling algorithm by measuring the size and orientation of portals in the scene, and results in a predictable sampling mechanism of visible set in the image space. An importance visibility sampling scheme in the image space is proposed based on the visibility portals, and used to guide the sampling process. Each newly added visibility sample is placed at the position potentially visible for most missing polygons. Experiments show that our sampling approach can effectively improve the performance of visibility sampling in both the convergence rate and the visual quality compared to the previous approaches.

[1]  Daniel Cohen-Or,et al.  Hardware-Accelerated from-Region Visibility Using a Dual Ray Space , 2001, Rendering Techniques.

[2]  Craig Gotsman,et al.  Optimized occlusion culling using five-dimensional subdivision , 1999, Comput. Graph..

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

[4]  Michael Wimmer,et al.  Visibility preprocessing for urban scenes using line space subdivision , 2001, Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001.

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

[6]  Edwin H. Blake,et al.  Hardware Accelerated Visibility Preprocessing using Adaptive Sampling , 2004, Rendering Techniques.

[7]  Michael Wimmer,et al.  Fast exact from-region visibility in urban scenes , 2005, EGSR '05.

[8]  Samuli Laine A general algorithm for output-sensitive visibility preprocessing , 2005, I3D '05.

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

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

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

[12]  Laurent Alonso,et al.  Using graphics hardware to speed-up your visibility queries , 2000 .

[13]  Michael Wimmer,et al.  Adaptive global visibility sampling , 2009, ACM Trans. Graph..

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

[15]  Daniel Cohen-Or,et al.  Virtual Occluders: An Efficient Intermediate PVS Representation , 2000, Rendering Techniques.

[16]  Donald P. Greenberg,et al.  The hemi-cube: a radiosity solution for complex environments , 1985, SIGGRAPH.

[17]  Nicolas Holzschuch,et al.  Using Graphics Hardware to Speed Up Visibility Queries , 2000, J. Graphics, GPU, & Game Tools.

[18]  Daniel Cohen-Or,et al.  Aggressive Visibility for Rendering Extremely Complex Foliage Scenes , 2004 .

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

[20]  François X. Sillion,et al.  Conservative volumetric visibility with occluder fusion , 2000, SIGGRAPH.

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

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