skip to main content
research-article

Guided Visibility Sampling++

Published:28 April 2021Publication History
Skip Abstract Section

Abstract

Visibility computation is a common problem in the field of computer graphics. Examples include occlusion culling, where parts of the scene are culled away, or global illumination simulations, which are based on the mutual visibility of pairs of points to calculate lighting. In this paper, an aggressive from-region visibility technique called Guided Visibility Sampling++ (GVS++) is presented. The proposed technique improves the Guided Visibility Sampling algorithm through improved sampling strategies, thus achieving low error rates on various scenes, and being over four orders of magnitude faster than the original CPU-based Guided Visibility Sampling implementation. We present sampling strategies that adaptively compute sample locations and use ray casting to determine a set of triangles visible from a flat or volumetric rectangular region in space. This set is called a potentially visible set (PVS). Based on initial random sampling, subsequent exploration phases progressively grow an intermediate solution. A termination criterion is used to terminate the PVS search. A modern implementation using the Vulkan graphics API and RTX ray tracing is discussed. Furthermore, we show optimizations that allow for an implementation that is over 20 times faster than a naive implementation.

Skip Supplemental Material Section

Supplemental Material

References

  1. John M Airey, John H Rohlf, and Frederick P Brooks Jr. 1990. Towards image realism with interactive update rates in complex virtual building environments. ACM SIGGRAPH computer graphics 24, 2 (1990), 41--50.Google ScholarGoogle Scholar
  2. Chandra R Bhat. 2003. Simulation estimation of mixed discrete choice models using randomized and scrambled Halton sequences. Transportation Research Part B: Methodological 37, 9 (2003), 837--855.Google ScholarGoogle Scholar
  3. Jirι Bittner. 2002. Hierarchical techniques for visibility computations. Ph.D. Dissertation. Czech Technical University.Google ScholarGoogle Scholar
  4. Jiří Bittner, Oliver Mattausch, Peter Wonka, Vlastimil Havran, and Michael Wimmer. 2009. Adaptive global visibility sampling. ACM Transactions on Graphics (TOG) 28, 3 (2009), 1--10.Google ScholarGoogle Scholar
  5. Jiří Bittner and Peter Wonka. 2003. Visibility in computer graphics. Environment and Planning B: Planning and Design 30, 5 (2003), 729--755.Google ScholarGoogle Scholar
  6. Jirí Bittner, Peter Wonka, and Michael Wimmer. 2005. Fast exact from-region visibility in urban scenes. In Rendering Techniques. 223--230.Google ScholarGoogle Scholar
  7. Daniel Cohen-Or, Yiorgos L Chrysanthou, Claudio T. Silva, and Frédo Durand. 2003. A survey of visibility for walkthrough applications. IEEE Transactions on Visualization and Computer Graphics 9, 3 (2003), 412--431.Google ScholarGoogle Scholar
  8. Frédo Durand. 1999. 3D Visibility: analytical study and applications. Ph.D. Dissertation.Google ScholarGoogle Scholar
  9. Frédo Durand, George Drettakis, Joëlle Thollot, and Claude Puech. 2000. Conservative visibility preprocessing using extended projections. In Proceedings of the 27th annual conference on Computer graphics and interactive techniques. 239--248.Google ScholarGoogle Scholar
  10. Craig Gotsman, Oded Sudarsky, and Jeffrey A Fayman. 1999. Optimized occlusion culling using five-dimensional subdivision. Computers & Graphics 23, 5 (1999), 645--654.Google ScholarGoogle Scholar
  11. Ned Greene, Michael Kass, and Gavin Miller. 1993. Hierarchical Z-buffer visibility. In Proceedings of the 20th annual conference on Computer graphics and interactive techniques. 231--238.Google ScholarGoogle Scholar
  12. Jozef Hladky, Hans-Peter Seidel, and Markus Steinberger. 2019. The camera offset space: real-time potentially visible set computations for streaming rendering. ACM Transactions on Graphics (TOG) 38, 6 (2019), 1--14.Google ScholarGoogle Scholar
  13. Tan-Chi Ho, Ying-I Chiu, Jung-Hong Chuang, and Wen-Chieh Lin. 2012. Aggressive region-based visibility computation using importance sampling. In Proceedings of the 11th ACM SIGGRAPH International Conference on Virtual-Reality Continuum and its Applications in Industry. 119--126.Google ScholarGoogle Scholar
  14. Samuli Laine and Tero Karras. 2010. Two Methods for Fast Ray-Cast Ambient Occlusion. In Computer Graphics Forum, Vol. 29. Wiley Online Library, 1325--1333.Google ScholarGoogle Scholar
  15. Tommer Leyvand, Olga Sorkine, and Daniel Cohen-Or. 2003. Ray space factorization for from-region visibility. In ACM SIGGRAPH 2003 Papers. 595--604.Google ScholarGoogle Scholar
  16. Amazon Lumberyard. 2017. Amazon Lumberyard Bistro, Open Research Content Archive (ORCA). Retrieved November 25, 2020 from http://developer.nvidia.com/orca/amazon-lumberyard-bistroGoogle ScholarGoogle Scholar
  17. Shaun Nirenstein and Edwin Blake. 2004. Hardware accelerated visibility preprocessing using adaptive sampling. (2004).Google ScholarGoogle Scholar
  18. Shaun Nirenstein, Edwin Blake, and James Gain. 2002. Exact from-region visibility culling. Eurographics.Google ScholarGoogle Scholar
  19. NVIDIA. 2018. NVIDIA Turing GPU Architecture. Retrieved November 25, 2020 from https://www.nvidia.com/en-us/geforce/news/geforce-rtx-20-series-turing-architecture-whitepaper/Google ScholarGoogle Scholar
  20. NVIDIA. 2020. NVIDIA Ampere GPU Architecture. Retrieved November 25, 2020 from https://www.nvidia.com/en-us/geforce/news/rtx-30-series-ampere-architecture-whitepaper-download/Google ScholarGoogle Scholar
  21. Alexander Reshetov, Alexei Soupikov, and Jim Hurley. 2005. Multi-level ray tracing algorithm. ACM Transactions on Graphics (TOG) 24, 3 (2005), 1176--1185.Google ScholarGoogle Scholar
  22. Gernot Schaufler, Julie Dorsey, Xavier Decoret, and François X Sillion. 2000. Conservative volumetric visibility with occluder fusion. In Proceedings of the 27th annual conference on Computer graphics and interactive techniques. 229--238.Google ScholarGoogle Scholar
  23. Seth J Teller and Carlo H Séquin. 1991. Visibility preprocessing for interactive walkthroughs. ACM SIGGRAPH Computer Graphics 25, 4 (1991), 61--70.Google ScholarGoogle Scholar
  24. UNC. 2001. Power Plant Model. Retrieved November 25, 2020 from http://gamma.cs.unc.edu/POWERPLANT/Google ScholarGoogle Scholar
  25. Johannes Unterguggenberger, Bernhard Kerbl, Markus Steinberger, Dieter Schmalstieg, and Michael Wimmer. 2020. Fast Multi-View Rendering for Real-Time Applications. (2020).Google ScholarGoogle Scholar
  26. Peter Wonka, Michael Wimmer, and François X Sillion. 2001. Instant visibility. In Computer Graphics Forum, Vol. 20. Wiley Online Library, 411--421.Google ScholarGoogle Scholar
  27. Peter Wonka, Michael Wimmer, Kaichi Zhou, Stefan Maierhofer, Gerd Hesina, and Alexander Reshetov. 2006. Guided visibility sampling. ACM Transactions on Graphics (TOG) 25, 3 (2006), 494--502.Google ScholarGoogle Scholar

Index Terms

  1. Guided Visibility Sampling++

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Article Metrics

      • Downloads (Last 12 months)24
      • Downloads (Last 6 weeks)2

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!