Space-Filling Curve Rendering for Low-Noise Pixel Sampling

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing photorealistic image synthesis methods using Monte Carlo and quasi-Monte Carlo methods for light transport simulation result in noisy images due to insufficient sampling, especially in real-time applications, and convergence issues due to intricate integral evaluation.

Innovation Solution

Enumerating samples of a low discrepancy sequence along a space-filling curve, such as the Hilbert curve, to assign sample locations to pixels, reducing inter-pixel correlations and enabling deterministic, parallel rendering.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If Monte Carlo and quasi-Monte Carlo methods are used for light transport simulation, then pixel colors can be estimated by sampling light transport paths, but images appear noisy when the number of samples is insufficient

Engineering Contradiction:
Improverendering speedVSAvoidimage quality
Core Design Contradiction:
ProductivityVSMeasurement precision

Solution Approach 1:

The patent segments the sampling process by applying a space-filling curve (such as Hilbert curve) to order the sampling of pixels. Instead of processing pixels in a traditional raster scan order, the space-filling curve creates a specific traversal sequence that groups spatially adjacent pixels together in the sampling order. This segmentation approach allows the rendering to progress through space in a coherent manner, reducing the visual impact of noise at low sample counts while maintaining rendering speed.

Inventive Principle:
Principle #1Segmentation

2Measurement precision

If the number of samples is increased to reduce noise, then image quality improves, but convergence is slow due to the intricacies of the integral evaluation

Engineering Contradiction:
Improveimage qualityVSAvoidconvergence time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent applies preliminary action by pre-defining the space-filling curve traversal order before the actual rendering process. This predetermined ordering strategy is established in advance and guides the sampling sequence throughout the rendering process. By having this structure ready beforehand, the system can efficiently distribute samples according to the space-filling curve without requiring complex runtime decisions, thus improving convergence speed while maintaining image quality.

Inventive Principle:
Principle #10Preliminary action

3Device complexity

If traditional raster scan order is used to assign samples to pixels, then processing is simple, but inter-pixel correlations increase and noise characteristics are less desirable

Engineering Contradiction:
Improveprocessing complexityVSAvoidnoise characteristics
Core Design Contradiction:
Device complexityVSMeasurement precision

Solution Approach 1:

The patent transforms the traditional two-dimensional raster scan ordering into a one-dimensional space-filling curve traversal. By mapping the 2D pixel grid onto a 1D curve sequence, the system changes the dimensionality of the sampling order. This transformation maintains simplicity in implementation while fundamentally improving the spatial coherence of sampling, as adjacent points on the curve correspond to spatially adjacent pixels, thereby reducing inter-pixel correlations and producing more desirable noise characteristics.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

Data Source

PatentUS12412250B2Rendering along a space-filling curve
Publication Date: 2025.09.09 NVIDIA CORP
  • US12412250B2 patent drawing
  • US12412250B2 patent drawing
  • US12412250B2 patent drawing

AI summary

In photorealistic image synthesis by light transport simulation, the colors of each pixel are an integral of a high-dimensional function. However, the functions to integrate contain discontinuities that cannot be predicted efficiently. In practice, the pixel colors are estimated by using Monte Carlo and quasi-Monte Carlo methods to sample light transport paths that connect light sources and cameras and summing up the contributions to evaluate an integral. Because of the sampling, images appear noisy when the number of samples is insufficient. A low discrepancy sequence provides sample locations and these sample locations can be enumerated (assigned or distributed to pixels) according to a space-filling curve superimposed on a pixel grid. Correlations of such combinations of space-filling curves and low discrepancy sequences are analyzed, and the presented algorithms reduce correlations, are deterministic, and may be executed for each pixel in parallel.