Аңдатпа
Procedural shading provides flexibility, scalability, and parametric control that are difficult to achieve with manual texturing. Procedural techniques are incorporated into numerous 3D packages and graphics applications. In these systems, materials are constructed by controlling directed acyclic graphs of shader operations. Despite the popularity of node-based materials, the relationship between structural complexity and rendering performance remains poorly understood. This paradigm improves accessibility and artistic productivity but can obscure the computational costs associated with increasing the complexity of the shader graph. This study examines the relationship between node graph structural complexity and rendering speed in the Eevee real-time engine of Blender. Six versions (V1-V6) of node graphs were created while preserving the visual result. Complexity was varied by increasing the number of nodes (from 11 to 352) and the depth of the graph (from 4 to 9). Each configuration was tested 25 times under controlled conditions to separate the steady-state rendering time from the initial overhead. Rendering time increases nonlinearly, with a sharp jump between graphs of medium and high complexity. Shader compilation metrics, on the other hand, showed non-monotonic behavior, which can be explained by the influence of internal optimization processes and engine caching mechanisms. These findings indicate that the structural features of graphs significantly affect performance and must be taken into account when designing materials for real-time applications.