Performance model of graphics pipeline for single-pass dynamic 3d scene rendering scheme

The paper considers a single-pass scheme for rendering dynamic 3D scenes using modern GPUs and graphics interfaces. The following methods and techniques are used with this scheme: clipping of objects using spatial decomposition and indexing methods, hardware occlusion queries, fragmentation and caching of command buffers. These methods require significant computational resources to execute, and the amount of work in the stages of the graphics pipeline depends on their results. Therefore, a balanced use of resources when transferring graphics data and executing commands is important. A performance model of the graphics pipeline is proposed, which makes it possible to estimate the required resources depending on the applied base methods and characteristics of the displayed scene. Unlike existing methods and models, the proposed model allows to calculate the costs of composing command buffers using various recording techniques, the costs of sending, executing, and receiving the results of hardware occlusion queries. Formulas are derived to calculate frame rendering time depending on the number of occlusion queries. A method is proposed to estimate the number of occlusion queries for efficient rendering of dynamic scenes. Computational experiments are carried out to show the relevance of the proposed model and the effectiveness of the developed method when displaying large dynamic scenes. Section 1 provides an overview of related work as well as general purposes of given paper and its structure. Section 2 describes the proposed performance model and method used to calculate the number of occlusion queries for efficient rendering of dynamic scenes. Section 3 presents the performance analysis, which contains derived and measured rendering time when rendering scenes and employing frustum culling, occlusion queries. Section 4 summarizes the main conclusions.

3d rendering, command buffer recording, occlusion culling, hardware occlusion queries, performance model of graphics pipeline

1. . Cohen-Or D., Chrysanthou Y. L., Silva C. T., Durand F. A survey of visibility for walkthrough applications // IEEE Transactions on Visualization and Computer Graphics. 2003. No. 3 (9). pp. 412–431.

2. . Airey J. Increasing Update Rates in the Building Walkthrough System with Automatic Model-Space Subdivision and Potentially Visible Set Calculations. PhD diss., University of North Carolina, Chappel Hill, 1991.

3. . Teller S. J. Visibility computations in densely occluded polyhedral environments. PhD diss., University of California at Berkeley, 1992.

4. . Luebke D., Georges C. Portals and mirrors: Simple, fast evaluation of potentially visible sets // In Proceedings of the 1995 symposium on Interactive 3D graphics. 1995. P. 105.

5. . Durand F., Drettakis G., Thollot J., Puech C. Conservative visibility preprocessing using extended projections // Proceedings of SIGGRAPH 2000. pp. 239–248.

6. . Greene N., Kass M., Miller G. Hierarchical Z-buffer visibility. ACM Press, 1993. pp. 231–238.

7. . Bittner J., Havran V., Slavik P. Hierarchical visibility culling with occlusion trees // Proceedings. Computer Graphics International (Cat. No. 98EX149). IEEE, 1998.

8. . Coorg S., Teller S. Temporally coherent conservative visibility // Computational Geometry 12. 1999. No. 1-2. pp. 105–124.

9. . Coorg S., Teller S. Real-time occlusion culling for models with large occluders // In Proceedings of the 1997 symposium on Interactive 3D graphics. 1997. pp. 83–90.

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

11. . Glassner A. S. Space subdivision for fast ray tracing // IEEE Computer Graphics and applications. 1984. Vol. 4, No. 10. pp. 15–24.

12. . Pharr M., Jakob W., Humphreys G. Physically based rendering: From theory to implementation / third ed., Morgan Kaufmann, 2016.

13. . Sudarsky O., Gotsman C. Dynamic scene occlusion culling // IEEE Transactions on Visualization and Computer Graphics 5. 1999. no. 1. pp. 13–29.

14. . Morozov S., Semenov V., Tarlapan O., Zolotov V. Indexing of Hierarchically Organized Spatial-Temporal Data Using Dynamic Regular Octrees // In: Petrenko A., Voronkov A. (eds) Perspectives of System Informatics. PSI 2017. Lecture Notes in Computer Science, vol 10742, pp. 276–290. doi: 10.1007/978-3-319-74313-4_20

15. . NV_occlusion_query. URL: https://www.khronos.org/registry/OpenGL/extensions/NV/NV_occlusion_query.txt (accessed 26.08.2020)

16. . Bittner J., Wimmer M., Piringer H., Purgathofer W. Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful // Computer Graphics Forum. 2004. No. 3 (23). pp. 615–624.

17. . Mattausch O., Bittner J., Wimmer M. CHC++: Coherent Hierarchical Culling Revisited // Computer Graphics Forum. 2008. No. 2 (27). pp. 221–230.

18. . Guthe M., Balázs Á., Klein R. Near Optimal Hierarchical Culling: Performance Driven Use of Hardware Occlusion Queries. 2006. pp. 207–214.

19. . Gonakhchyan V.I. Efficient command buffer recording for accelerated rendering of large 3d scenes. IADIS Press, 2018. pp. 397–402.

20. . Funkhouser T.A., Séquin C.H. Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments. ACM Press, 1993. pp. 247–254.

21. . Wimmer M., Wonka P. Rendering time estimation for real-time rendering. 2003. pp. 118–129.

22. . Weisstein, Eric W. Least Squares Fitting—Logarithmic // From MathWorld—A Wolfram Web Resource. URL: https://mathworld.wolfram.com/LeastSquaresFittingLogarithmic.html (accessed 26.08.2020).

23. . Chernjak A.A., Chernjak Zh.A., Metel'skij Ju.M., Bogdanovich S.A. Metody optimizacii: teorija i algoritmy / 2 ed., M: Jurajt, 2017. 357 p.