Skip to main content
SpringerLink
Log in

A draw call-oriented approach for visibility of static and dynamic scenes with large number of triangles

  • Original Article
  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

Graphical applications require high levels of interactivity, usually measured in frames per second (FPS), which motivates the development of increasingly efficient and versatile solutions for the rendering process. Visibility culling algorithms are used to determine which surfaces (or sets of triangles) in a 3D scene are not visible from a certain viewpoint. However, the precision of this step in the graphics pipeline does not necessarily guarantee better FPS rates, since it is directly related to the number of draw calls made to render the set of triangles currently viewed. In addition, this process may be costly enough to compromise the level of interactivity that the application user perceives. In this work, we present RHView, a solution to the visibility problem that focuses on the trade-off between visibility culling precision and the number of draw calls to achieve high FPS rates in complex scenes with approximately 650 million triangles, with both static and dynamic objects. Our approach uses both the view frustum culling and occlusion culling algorithms adapted for greater synergy with RHOctree, a spatial partitioning structure we have designed from heuristics, temporal coherence and index replication to reduce the number of draw calls. The results show that it is possible to achieve FPS rates up to thirty times higher than with some traditional solutions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

References

  1. Alderson, T., Samavati, F.: Optimizing line-of-sight using simplified regular terrains. Vis. Comput. 31(4), 407–421 (2015)

    Article  Google Scholar 

  2. Batagelo, H.C., Shin-Ting, W.: Dynamic scene occlusion culling using a regular grid. In: Proceedings of the XV Computer Graphics and Image Processing, 2002. Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI), pp. 43–50. IEEE (2002)

  3. Bittner, J., Havran, V., Slavik, P.: Hierarchical visibility culling with occlusion trees. In: Proceedings of the 1998 Computer Graphics International, pp. 207–219. IEEE (1998)

  4. Chen, J., Jiang, S., Destefano, Z., Yoon, S., Gopi, M.: Optimally redundant, seek-time minimizing data layout for interactive rendering. Vis. Comput. 33(2), 139–149 (2017)

    Article  Google Scholar 

  5. Cohen-Or, D., Chrysanthou, Y.L., Silva, C.T., Durand, F.: A survey of visibility for walkthrough applications. IEEE Trans. Vis. Comput. Graph. 9(3), 412–431 (2003)

    Article  Google Scholar 

  6. Corporation, V.: Team fortress 2. http://www.teamfortress.com (2007). Accessed 24 June 2017

  7. Foundation, B.: Blender 3D. http://www.blender.org (2016). Accessed 24 June 2017

  8. Funkhouser, T.A., Séquin, C.H.: Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments. In: Proceedings of the 20th Annual Conference on Computer Graphics and Interactive Techniques, pp. 247–254. ACM (1993)

  9. Guthe, M., Balázs, Á., Klein, R.: Near optimal hierarchical culling: performance driven use of hardware occlusion queries. In: Proceedings of the Eurographics Symposium on Rendering Techniques, pp. 207–214 (2006)

  10. Hasselgren, J., Andersson, M., Akenine-Möller, T.: Masked software occlusion culling. In: Proceedings of the 2016 High Performance Graphics, pp. 23–31. Eurographics Association (2016)

  11. Hey, H., Purgathofer, W.: Occlusion culling methods. In: Proceedings of the 2001 Eurographics, p. 43 (2001)

  12. Hillesland, K., Salomon, B., Lastra, A., Manocha, D.: Fast and simple occlusion culling using hardware-based depth queries. Tech. rep., Chapel Hill: University of North Carolina (2002)

  13. Hudson, T., Manocha, D., Cohen, J., Lin, M., Hoff, K., Zhang, H.: Accelerated occlusion culling using shadow frusta. In: Proceedings of the 13th Annual Symposium on Computational Geometry, pp. 1–10. ACM (1997)

  14. Mattausch, O., Bittner, J., Wimmer, M.: CHC++: Coherent hierarchical culling revisited. In: Proceedings of the Eurographics 2008, vol. 27, pp. 221–230. Wiley Online Library (2008)

  15. Muldoon, M.: Blend swap. http://www.blendswap.com (2015). Accessed 24 June 2017

  16. Papaioannou, G., Gaitatzes, A., Christopoulos, D.: Efficient occlusion culling using solid occluders. In: Proceedings of the 14th International Conference in Central Europe on Computer Graphics. Václav Skala—UNION Agency (2006)

  17. RHView: Static scenes with and without dynamic objects. RHView: a draw call oriented approach for visibility of static and dynamic scenes with large-number of triangles. (Online). https://youtu.be/9HEvbyi1dgM and https://youtu.be/JDnpPw2EGFo (2017). Accessed 24 June 2017

  18. Samet, H., Webber, R.E.: Hierarchical data structures and algorithms for computer graphics I. fundamentals. IEEE Comput. Graphics Appl. 8(3), 48–68 (1988)

    Article  Google Scholar 

  19. Schmidt, M.R.: Toward improved batchability of 3D objects using a consolidated shader. J. Graph. Tools 17(4), 151–158 (2013)

    Article  Google Scholar 

  20. Sekulic, D.: Efficient occlusion culling. In: R. Fernando (ed.) GPU Gems, pp. 487–503. Addison-Wesley (2004). http://tinyurl.com/hdkl8fp

  21. Serpa, Y.R., Serpa, Y.R., Rodrigues, M.A.E.: A comparative study on a novel drawcall-wise visibility culling and space-partitioning data structures. In: Proceedings of the XV SBGames, 2016. Brazilian Symposium on Games (SBGAMES), pp 36–43. SBC (2016)

  22. Stanford University: The stanford 3D scanning repository. (Online). http://graphics.stanford.edu/data/3Dscanrep/ (2014). Accessed 24 June 2017

  23. Toledo, L., De Gyves, O., Rudomín, I.: Hierarchical level of detail for varied animated crowds. Vis. Comput. 30(6–8), 949–961 (2014)

    Article  Google Scholar 

  24. University of North Carolina: Power plant model. http://gamma.cs.unc.edu/Powerplant/ (2001). Accessed 24 June 2017

  25. Wimmer, M., Wonka, P.: Rendering time estimation for real-time rendering. In: Proceedings of the 2003 Eurographics Symposium on Rendering, pp. 118–129. Eurographics (2003)

  26. Wloka, M.: Batch, batch, batch: what does it really mean? Presentation at Game Developers Conference (2003). http://tinyurl.com/glo7o7k

  27. Zhang, H., Manocha, D., Hudson, T., Hoff III, K.E.: Visibility culling using hierarchical occlusion maps. In: Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques, pp. 77–88. ACM Press/Addison-Wesley Publishing Co. (1997)

Download references

Acknowledgements

Maria Andréia Formico Rodrigues and Yvens Rebouças Serpa would like to thank the Brazilian Agencies CAPES and FUNCAP-CE for their financial support, respectively, under grants 88881.120921/2016-01 and PEP-0094-00005.01.09/2014. The authors would like to also thank the referees for their valuable comments which helped to improve the manuscript.

Author information

Authors and Affiliations

  1. PPGIA, Universidade de Fortaleza (UNIFOR), Av. Washington Soares 1321, J30, Fortaleza-CE, 60811-905, Brazil

    Yvens Rebouças Serpa & Maria Andréia Formico Rodrigues

Authors
  1. Yvens Rebouças Serpa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maria Andréia Formico Rodrigues
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maria Andréia Formico Rodrigues.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Serpa, Y.R., Rodrigues, M.A.F. A draw call-oriented approach for visibility of static and dynamic scenes with large number of triangles. Vis Comput 35, 549–563 (2019). https://doi.org/10.1007/s00371-018-1484-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00371-018-1484-z

Keywords

Search

Navigation