Procedural Versus Baked Textures in Path-Traced Rendering: A Controlled Comparison of Render Time and Memory...

Procedural textures trade image storage for runtime shader evaluation, whereas baked bitmaps replace repeated procedural computation with stored image data. Controlled path-tracing comparisons that isolate this representation choice remain limited. This study compares four procedural Base Color graphs with their 20482 baked bitmap counterparts in Blender Cycles 5.2 on a GIGABYTE NVIDIA GTX 1050 Ti (GIGA-BYTE Technology Co., Ltd., New Taipei City, Taiwan) while holding geometry, lighting, camera, sampling and BSDF parameters constant. Three texture graphs-checker, noise and multifractal-were examined in a predefined ordering by computational demand, while ambient occlusion was analyzed separately as a ray-traced effect. The primary experiment comprised 480 renders, of which 360 were analyzed using block means as the inferential unit. Block-level models showed that the procedural checker was 0.65% faster than its baked counterpart, whereas the bitmap representation was 1.73% faster for noise and 3.53% faster for multifractal; all four primary representation effects had 95% confidence intervals excluding zero after Holm adjustment. Baking ambient occlusion reduced render time by 67.74% under the tested configuration. The bitmap branch increased Cycles-reported internal peak memory by exactly 16 MiB at 20482, while resolution tests produced increments of 1, 4 and 64 MiB at 5122, 10242 and 40962, respectively. Because the 20482 baked multifractal showed lower visual agreement with its procedural source, a targeted 40962 follow-up comprising a further 120 renders, of which 90 were analyzed, was conducted. Increasing the multifractal bake resolution improved SSIM from 0.886 to 0.936, increased the image-texture footprint from 16 to 64 MiB, and reduced the bitmap render-time advantage from 3.53% to 1.73%. Across the three primary texture graphs, the bitmap advantage increased along the predefined ordering by computational demand; however, computational demand was not isolated from differences in algorithm, coordinate system, and spatial structure. The results therefore demonstrate configuration-specific trade-offs among render time, image-memory footprint, and representation fidelity rather than a universal preference for either representation.