COMPARISON OF RENDER OPTIMIZATION ALGORITHMS IN MODERN COMPUTER GAMES

In this paper different occlusion culling algorithms will be considered. Also will be performed analysis of each of them, their history, the need arising, mathematical and logical basis for algorithms. There was also developed rendering engine in which these algorithms have been implemented and tested on several test scenes. The result of the paper is comparative characteristic of algorithms to determine the level of efficiency and the number of resources required for each algorithm. Strengths and weaknesses of each of the algorithms will be determined and will be made conclusions based on the data obtained. This feature will make it possible to use the strengths of the algorithms and protect their weaknesses by other algorithms.