Guided visibility sampling

This paper addresses the problem of computing the triangles visible from a region in space. The proposed aggressive visibility solution is based on stochastic ray shooting and can take any triangular model as input. We do not rely on connectivity information, volumetric occluders, or the availability of large occluders, and can therefore process any given input scene. The proposed algorithm is practically memoryless, thereby alleviating the large memory consumption problems prevalent in several previous algorithms. The strategy of our algorithm is to use ray mutations in ray space to cast rays that are likely to sample new triangles. Our algorithm improves the sampling efficiency of previous work by over two orders of magnitude.

[1]  Michael Wimmer,et al.  Automatic impostor placement for guaranteed frame rates and low memory requirements , 2005, I3D '05.

[2]  Michael Wimmer,et al.  Instant Visibility , 2001, Comput. Graph. Forum.

[3]  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.

[4]  Frederick P. Brooks,et al.  Towards image realism with interactive update rates in complex virtual building environments , 1990, I3D '90.

[5]  Philipp Slusallek,et al.  An interactive out-of-core rendering framework for visualizing massively complex models , 2004, Rendering Techniques.

[6]  Marc Levoy,et al.  Light field rendering , 1996, SIGGRAPH.

[7]  P. Slusallek,et al.  RPU: a programmable ray processing unit for realtime ray tracing , 2005, SIGGRAPH '05.

[8]  Alexander Reshetov,et al.  Multi-level ray tracing algorithm , 2005, ACM Trans. Graph..

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

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

[11]  Dinesh Manocha,et al.  Simplifying complex environments using incremental textured depth meshes , 2003, ACM Trans. Graph..

[12]  Philipp Slusallek,et al.  Realtime Ray Tracing and its use for Interactive Global Illumination , 2003, Eurographics.

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

[14]  George Drettakis,et al.  Robust epsilon visibility , 2002, ACM Trans. Graph..

[15]  Carlos Andújar,et al.  LOD visibility culling and occluder synthesis , 2000, Comput. Aided Des..

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

[17]  Richard Szeliski,et al.  Layered depth images , 1998, SIGGRAPH.

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

[19]  Luc Van Gool,et al.  Procedural modeling of buildings , 2006, SIGGRAPH 2006.

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

[21]  Budirijanto Purnomo,et al.  vLOD: high-fidelity walkthrough of large virtual environments , 2005, IEEE Transactions on Visualization and Computer Graphics.

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

[23]  Jirí Bittner.  Efficient construction of visibility maps using approximate occlusion sweep , 2002, SCCG '02.

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

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

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

[27]  Frédo Durand,et al.  3d visibility: analytical study and applications , 1999 .

[28]  Wolfgang Stuerzlinger,et al.  Imaging all Visible Surfaces , 1999, Graphics Interface.

[29]  Harald Niederreiter,et al.  Random number generation and Quasi-Monte Carlo methods , 1992, CBMS-NSF regional conference series in applied mathematics.

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

[31]  Ji ˇ ´ Bittner,et al.  Hierarchical Techniques for Visibility Computations , 2002 .

[32]  Carlo H. Séquin,et al.  Visibility preprocessing for interactive walkthroughs , 1991, SIGGRAPH.

[33]  Richard Pito,et al.  A Solution to the Next Best View Problem for Automated Surface Acquisition , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

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