Analysis of the computational complexity of rendering methods

Abstract

is paper analyzes the main rendering methods in computer graphics with an emphasis on their computational complexity and application areas. Classical approaches to surface shading are considered. For each method, the asymptotic time complexity is evaluated both for the entire scene and for individual objects (using the Utah teapot model as an example). The prevalence of these methods in modern practice including the game industry, offline visualization, and scientific and medical graphics is also analyzed.