Potentially visible set

From Wikipedia, the free encyclopedia

In 3D computer graphics, Potentially Visible Sets are used to accelerate the rendering of 3D environments. They are a form of occlusion culling, whereby a candidate set of potentially visible polygons are pre-computed, then indexed at run-time in order to quickly obtain an estimate of the visible geometry. The term PVS is sometimes used to refer to any occlusion culling algorithm (since in effect, this is what all occlusion algorithms compute), although in almost all the literature, it is used to refer specifically to occlusion culling algorithms that pre-compute visible sets and associate these sets with regions in space. In order to make this association, the camera's view-space (the set of points from which the camera can render an image) is typically subdivided into (usually convex) regions and a PVS is computed for each region.

Benefits vs. Cost[edit]

The benefit of offloading visibility as a pre-process are:

  • The application just has to look up the pre-computed set given its view position. This set may be further reduced via frustum culling. Computationally, this is far cheaper than computing occlusion based visibility every frame.
  • Within a frame, time is limited. Only 1/60th of a second (assuming a 60 Hz frame-rate) is available for visibility determination, rendering preparation (assuming graphics hardware), AI, physics, or whatever other app specific code is required. In contrast, the offline pre-processing of a potentially visible set can take as long as required in order to compute accurate visibility.

The disadvantages are:

  • There are additional storage requirements for the PVS data.
  • Preprocessing times may be long or inconvenient.
  • Can't be used for completely dynamic scenes.
  • The visible set for a region can in some cases be much larger than for a point.

Primary Problem[edit]

The primary problem in PVS computation then becomes: Compute the set of polygons that can be visible from anywhere inside each region of a set of polyhedral regions.

There are various classifications of PVS algorithms with respect to the type of visibility set they compute.[1][2]

Conservative algorithms[edit]

These overestimate visibility consistently, such that no triangle that is visible may be omitted. The net result is that no image error is possible, however, it is possible to greatly overestimate visibility, leading to inefficient rendering (due to the rendering of invisible geometry). The focus on conservative algorithm research is maximizing occluder fusion in order to reduce this overestimation. The list of publications on this type of algorithm is extensive – good surveys on this topic include Cohen-Or et al.[2] and Durand.[3]

Aggressive algorithms[edit]

These underestimate visibility consistently, such that no redundant (invisible) polygons exist in the PVS set, although it may be possible to miss a polygon that is actually visible leading to image errors. The focus on aggressive algorithm research is to reduce the potential error.[4][5]

Approximate algorithms[edit]

These can result in both redundancy and image error.[6]

Exact algorithms[edit]

These provide optimal visibility sets, where there is no image error and no redundancy. They are, however, complex to implement and typically run a lot slower than other PVS based visibility algorithms. Teller computed exact visibility for a scene subdivided into cells and portals[7] (see also portal rendering).

The first general tractable 3D solutions were presented in 2002 by Nirenstein et al.[1] and Bittner.[8] Haumont et al.[9] improve on the performance of these techniques significantly. Bittner et al.[10] solve the problem for 2.5D urban scenes. Although not quite related to PVS computation, the work on the 3D Visibility Complex and 3D Visibility Skeleton by Durand[3] provides an excellent theoretical background on analytic visibility.

Visibility in 3D is inherently a 4-Dimensional problem. To tackle this, solutions are often performed using Plücker coordinates, which effectively linearize the problem in a 5D projective space. Ultimately, these problems are solved with higher-dimensional constructive solid geometry.

Secondary Problems[edit]

Some interesting secondary problems include:

  • Compute an optimal sub-division in order to maximize visibility culling.[7][11][12]
  • Compress the visible set data in order to minimize storage overhead.[13]

Implementation Variants[edit]

  • It is often undesirable or inefficient to simply compute triangle level visibility. Graphics hardware prefers objects to be static and remain in video memory. Therefore, it is generally better to compute visibility on a per-object basis and to sub-divide any objects that may be too large individually. This adds conservativity, but the benefit is better hardware utilization and compression (since visibility data is now per-object, rather than per-triangle).
  • Computing cell or sector visibility is also advantageous, since by determining visible regions of space, rather than visible objects, it is possible to not only cull out static objects in those regions, but dynamic objects as well.


  1. ^ a b S. Nirenstein, E. Blake, and J. Gain. Exact from-region visibility culling, In Proceedings of the 13th workshop on Rendering, pages 191–202. Eurographics Association, June 2002.
  2. ^ a b Cohen-Or, D.; Chrysanthou, Y. L.; Silva, C. T.; Durand, F. (2003). "A survey of visibility for walkthrough applications". IEEE Transactions on Visualization and Computer Graphics. 9 (3): 412–431. CiteSeerX doi:10.1109/TVCG.2003.1207447.
  3. ^ a b 3D Visibility: Analytical study and Applications, Frédo Durand, PhD thesis, Université Joseph Fourier, Grenoble, France, July 1999. is strongly related to exact visibility computations.
  4. ^ Shaun Nirenstein and Edwin Blake, Hardware Accelerated Visibility Preprocessing using Adaptive Sampling, Rendering Techniques 2004: Proceedings of the 15th Eurographics Symposium on Rendering, 207- 216, Norrköping, Sweden, June 2004.
  5. ^ Wonka, P.; Wimmer, M.; Zhou, K.; Maierhofer, S.; Hesina, G.; Reshetov, A. (July 2006). Guided visibility sampling. Proceedings of ACM SIGGRAPH 2006. Vol. 25. pp. 494–502. doi:10.1145/1179352.1141914. ISBN 978-1595933645. S2CID 9218485. {{cite book}}: |journal= ignored (help)
  6. ^ Gotsman, C.; Sudarsky, O.; Fayman, J. A. (October 1999). "Optimized occlusion culling using five-dimensional subdivision" (PDF). Computers & Graphics. 23 (5): 645–654. doi:10.1016/S0097-8493(99)00088-6.
  7. ^ a b Seth Teller, Visibility Computations in Densely Occluded Polyhedral Environments (Part 2 of 3) (PhD dissertation, Berkeley, 1992)
  8. ^ Jiri Bittner. Hierarchical Techniques for Visibility Computations, PhD Dissertation. Department of Computer Science and Engineering. Czech Technical University in Prague. Submitted October 2002, defended March 2003.
  9. ^ Denis Haumont, Otso Mäkinen & Shaun Nirenstein (June 2005). A Low Dimensional Framework for Exact Polygon-to-Polygon Occlusion Queries. Rendering Techniques 2005: Proceedings of the 16th Eurographics Symposium on Rendering, Konstanz, Germany. pp. 211–222. CiteSeerX doi:10.2312/EGWR/EGSR05/211-222.
  10. ^ Jiri Bittner; Peter Wonka & Michael Wimmer (2005). "Fast Exact From-Region Visibility in Urban Scenes" (PDF). In Proceedings of Eurographics Symposium on Rendering: 223–230. doi:10.2312/EGWR/EGSR05/223-230. S2CID 9126258.
  11. ^ D. Haumont, O. Debeir & F. Sillion (September 2003). "Volumetric Cell-and-Portal Generation". Graphics Forum. 22 (3): 303–312. CiteSeerX doi:10.1111/1467-8659.00677. S2CID 14281909.
  12. ^ Oliver Mattausch; Jiri Bittner; Michael Wimmer (2006). "Adaptive Visibility-Driven View Cell Construction". Proceedings of Eurographics Symposium on Rendering: 195–205. CiteSeerX doi:10.2312/EGWR/EGSR06/195-205. S2CID 17919019.
  13. ^ Michiel van de Panne & A. James Stewart (June 1999). "Effective Compression Techniques for Precomputed Visibility". Eurographics Workshop on Rendering: 305–316. CiteSeerX

External links[edit]

Cited author's pages (including publications):

Other links: