Blender Git Loki

Git Commits -> Revision 4fb0aab

April 15, 2019, 11:49 (GMT)
Adaptive Sampling for Cycles.

This feature takes some inspiration from
"RenderMan: An Advanced Path Tracing Architecture for Movie Rendering" and
"A Hierarchical Automatic Stopping Condition for Monte Carlo Global Illumination"

In addition, it implements the sampling pattern described in
"Progressive Multi-Jittered Sample Sequences"

The basic principle is as follows:
While samples are being added to a pixel, the adaptive sampler writes half
of the samples to a separate buffer. This gives it two separate estimates
of the same pixel, and by comparing their difference it estimates convergence.
Once convergence drops below a given threshold, the pixel is considered done.

When a pixel has not converged yet and needs more samples than the minimum,
its immediate neighbors are also set to take more samples. This is done in order
to more reliably detect sharp features such as caustics. A 3x3 box filter that
is run peridoically over the tile buffer is used for that purpose.

After a tile is finished rendering, the values of all passes are scaled as if
they were rendered with the full number of samples. This way, any code operating
on these buffers, for example the denoiser, does not need to be changed for
per-pixel sample counts.

Differential Revision: https://developer.blender.org/D4686

Commit Details:

Full Hash: 4fb0aab244fc7d9153b6dea423a949da23ecaa95
Parent Commit: b1b770d
Lines Changed: +7, -5

3 Modified Paths:

/intern/cycles/blender/addon/ui.py (+4, -3) (Diff)
/intern/cycles/blender/blender_sync.cpp (+2, -1) (Diff)
/intern/cycles/render/integrator.cpp (+1, -1) (Diff)
Tehnyt: Miika HämäläinenViimeksi päivitetty: 07.11.2014 14:18MiikaH:n Sivut a.k.a. MiikaHweb | 2003-2021