ALGORITHMIC AND SOFTWARE SUPPORT FOR MULTI-CRITERION OPTIMAL TRIANGULATION OF POLYGONS TO INCREASE THE EFFICIENCY OF 3D VISUALIZATION SOFTWARE SYSTEMS

Abstract

The article considers the problem of increasing the productivity of three-dimensional visualization software systems by optimizing the process of triangulation of polygonal models. Most modern graphics engines use triangles as basic rendering primitives, however, standard triangulation algorithms are focused mainly on the speed of mesh construction, rather than on the subsequent efficiency of visualization. A method of multi-criteria selection of the optimal option for triangulation of a simple polygon is proposed based on the evaluation of all admissible partition structures or their reduced set. The optimization criteria used are minimization of the area of pixel repainting, improvement of the geometric shape of triangles, and reduction of computational costs during rendering. A software model of the algorithm is developed using dynamic programming. Experimental modeling results are presented, which confirm the possibility of reducing redundant graphic operations and increasing the efficiency of displaying complex scenes.