Occluder Simplification Using Planar Sections

We present a method for extreme occluder simplification. We take a triangle soup as input, and produce a small set of polygons with closely matching occlusion properties. In contrast to methods that optimize the original geometry, our algorithm has very few requirements for the input— specifically, the input does not need to be a watertight, two‐manifold mesh. This robustness is achieved by working on a well‐behaved, discretized representation of the input instead of the original, potentially badly structured geometry. We first formulate the algorithm for individual occluders, and further introduce a hierarchy for handling large, complex scenes.

[1]  Dinesh Manocha,et al.  Simplification envelopes , 1996, SIGGRAPH.

[2]  Greg Turk,et al.  Simplification and Repair of Polygonal Models Using Volumetric Techniques , 2003, IEEE Trans. Vis. Comput. Graph..

[3]  Thomas K. Peucker,et al.  2. Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or its Caricature , 2011 .

[4]  Carsten Dachsbacher,et al.  Analyzing Visibility Configurations , 2011, IEEE Transactions on Visualization and Computer Graphics.

[5]  Urs Ramer,et al.  An iterative procedure for the polygonal approximation of plane curves , 1972, Comput. Graph. Image Process..

[6]  David P. Luebke,et al.  Portals and mirrors: simple, fast evaluation of potentially visible sets , 1995, I3D '95.

[7]  Seth J. Teller,et al.  Real-time occlusion culling for models with large occluders , 1997, SI3D.

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

[9]  Azriel Rosenfeld,et al.  Sequential Operations in Digital Picture Processing , 1966, JACM.

[10]  Will Vale.  Practical occlusion culling in KILLZONE 3. , 2011, SIGGRAPH 2011.

[11]  Rick Germs,et al.  Geometric Simplification for Efficient Occlusion Culling in Urban Scenes , 2001, WSCG.

[12]  Emil Persson,et al.  Creating vast game worlds: experiences from Avalanche Studios , 2012, SIGGRAPH '12.

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

[14]  David H. Douglas,et al.  ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .

[15]  Michael Garland,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.

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

[17]  Tiow Seng Tan,et al.  Preprocessing occlusion for real-time selective refinement , 1999, SI3D.

[18]  Greg Turk,et al.  Image-driven simplification , 2000, TOGS.

[19]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[20]  Dieter Schmalstieg,et al.  Occluder Shadows for Fast Walkthroughs of Urban Environments , 1999, Comput. Graph. Forum.

[21]  Tiow Seng Tan,et al.  Jump flooding in GPU with applications to Voronoi diagram and distance transform , 2006, I3D '06.

[22]  Eugene Zhang,et al.  Visibility-guided simplification , 2002, IEEE Visualization, 2002. VIS 2002..

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

[24]  Frédo Durand,et al.  Billboard clouds for extreme model simplification , 2003, ACM Trans. Graph..