Efficient construction of visibility maps using approximate occlusion sweep

We present an algorithm that efficiently constructs a visibility map for a given view of a polygonal scene. The view is represented by a BSP tree and the visibility map is obtained by postprocessing of that tree. The scene is organised in a kD-tree that is used to perform an approximate occlusion sweep. The occlusion sweep is interleaved with hierarchical visibility tests what results in expected output sensitive behaviour of the algorithm. We evaluate our implementation of the method on several scenes and demonstrate its application to discontinuity meshing.

[1]  Thomas Ertl,et al.  Computer Graphics - Principles and Practice, 3rd Edition , 2014 .

[2]  Gavin S. P. Miller,et al.  Hierarchical Z-buffer visibility , 1993, SIGGRAPH.

[3]  M. Carter.  Computer graphics: Principles and practice , 1997 .

[4]  Vlastimil Havran,et al.  Hierarchical visibility culling with occlusion trees , 1998, Proceedings. Computer Graphics International (Cat. No.98EX149).

[5]  Steven K. Feiner,et al.  Near real-time shadow generation using BSP trees , 1989, SIGGRAPH '89.

[6]  Henry Fuchs,et al.  On visible surface generation by a priori tree structures , 1980, SIGGRAPH '80.

[7]  Dimitri Plemenos,et al.  Accurate Scene Display by Using Visibility Maps , 1999 .

[8]  Jirí Bittner,et al.  Exact regional visibility using line space partitioning , 2003, Comput. Graph..

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

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

[11]  A. James Stewart,et al.  Computing the Approximate Visibility map, with Applications to Form Factors and Discontinuity Meshing , 1998, Rendering Techniques.

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

[13]  Dinesh Manocha,et al.  Accelerated occlusion culling using shadow frusta , 1997, SCG '97.

[14]  Bruce F. Naylor.  Partitioning tree image representation and generation from 3D geometric models , 1992 .