Volumetric cloud rendering has really exploded in recent years. This can largely be attributed to GPUs being fast enough to utilize ray marching techniques in real-time, something which previously was limited mostly to the demo scene. However, care still needs to be taken when rendering volumetrics, as cranking the sample count way up will slay the mightiest of GPUs.
The problem is we want to do just that. Crank the sample count way up. If we don’t, we’ll either have to make do with soft, undefined volumes, or try to deal with horrible banding/noisy output and smear it over time, which looks absolutely terrible in VR.
About a year ago, I was observing some sparse but dense cumulus cloud formations, similar to this image (but even denser):
Thinking about how to recreate it in UHawk really frustrated me because I knew that to get those kind of well-defined shapes, a lot of samples would be needed. Worse still, most of the samples wouldn’t even contribute to the final image because of how much empty space there was:
All that red is your GPU calculating the value 0 in very expensive ways
Ideally, we’d want to spend our ray samples only where there are clouds. Instead, we end up spending a ton of them just to check and be able to say “Yep, no clouds here!”. We end up spending only a fraction of the sample count on something actually visible = bad visuals for worse performance.
I started thinking “If only there was a way for the ray to advance really quickly to the first cloud intersection. Then you could spend your ray budget where it really matters!”. Then I realized this was a technique I already knew and had experience with.
Enter signed distance
Animated visualization of a distance field. Source in the link below.
If you want a full overview of what a signed distance field is, I recommend checking out this great article by Jamie Wong. Basically, you construct a data structure (field) which, for each entry, contains the distance to the nearest point of some surface. This works for 2D and 3D (and presumably other dimensions as well).
In 2D it is used to render text, but since we’re working in 3D we’ll use it to represent a volume. More specifically, we are going to use it to skip through empty space as quickly as we can by taking large steps forward, with each step size being equal to the value of the signed distance at the current ray march position. Because the SDF guarantees that no surface is closer than that value, it is safe to skip forward by that amount.
Visualization of how empty space can be skipped when rendering with a signed distance field. The blue points represent the ray march positions and the yellow circles represent the value of the distance field.
Source: GPU Gems 2: Chapter 8.
Because our SDF is a volume containing arbitrary distances, the data structure we’ll be using is a signed, half-precision floating point 3D texture. Each pixel in the texture represents the signed distance to the shell of our cloud volume. The signed part means that if the pixel is inside the volume, the value will be negative (we won’t use this for the ray-marching, but it can be used to increase the sample density the further into the cloud we get).
The texture will have to be quite low res, as ray-marching a high-resolution 3D texture is very expensive. I’m using a 128x32x128 texture which is sampled non-uniformly (stretched by a factor of 6 horizontally) to cover a larger area. The texture should also tile horizontally so we get an infinitely extending cloud plane.
Before we can calulate the SDF, we need a volume representing our clouds. I use a layered system where a compute shader is run for each cloud layer and adds it to an RG16 3D texture of the same resolution as our SDF. The method for generating the cloud shapes is similar to the method described here by Sébastien Hillaire. The red channel contains the coverage and the green channel contains the density (used by the ray-marcher, adding support for varying density).
Recalculating the distance field texture is expensive (takes about 200ms using a 3-pass compute shader on my GTX1070), so we’ll have to limit the system to having a static cloud volume. This might be a deal breaker for some, but for my game I’ll gladly take non-dynamic clouds if it means increasing the visual fidelity and performance. What we can do instead is scroll the volume itself, which will at least give us some movement.
The bipolar ray marcher
Now that we’ve got a SDF representing our clouds, it’s time to ray march it. Our ray marcher has two modes:
- SDF – Used when outside the cloud volume. Step size is determined by the SDF value. Visualized in blue in the figure below.
- Regular – Used when inside the cloud volume. Step size is fixed. Visualized in cyan in the figure below.
Additionally, we skip areas outside of the cloud volume entirely, visualized in red in the figure below.
How you do the ray marching depends on your setup and code style, but here’s a basic copy of what my code is doing (with implementation-specific optimizations stripped):
// The fixed step size of the inner ray marching
uniform float _StepSize;
float DensityFunction (float sdf)
return max(-sdf, 0);
float4 Raymarch (float3 rayStart, float3 rayDir)
// Scattering in RGB, transmission in A
float4 intScattTrans = float4(0, 0, 0, 1);
// Current distance along ray
float t = 0;
for (int u = 0; u < RAY_MAX_STEPS; u++)
// Current ray position
float3 rayPos = rayStart + rayDir * t;
// Evaluate our signed distance field at the current ray position
float sdf = MapVolume(rayPos);
// Only evaluate the cloud color if we're inside the volume
if (sdf < 0)
half extinction = DensityFunction(sdf);
half transmittance = exp(-extinction * _StepSize);
// Get the luminance for the current ray position
half3 luminance = Luminance(rayPos);
// Integrate scattering
half3 integScatt = luminance - luminance * transmittance;
intScattTrans.rgb += integScatt * intScattTrans.a;
intScattTrans.a *= transmittance;
// Opaque check
if (intScattTrans.a < 0.003)
intScattTrans.a = 0.0;
// March forward; step size depends on if we're inside the volume or not
t += sdf < 0 ? _StepSize : max(sdf, _StepSize);
return float4(intScattTrans.rgb, 1-intScattTrans.a);
The ray marcher code itself is really simple now that I look at it with all the details stripped. Here’s what it looks like when ray marching the base volume only:
And here’s with two 3D detail passes added (perlin-worley):
Finally, here’s a video of it in action in my game:
But wait, there’s more! Since we’ve limited the system to working with static data, why not bake some more? In addition to the SDF, we can pre-march a shadow + ambient ray.
Here’s with just the realtime shadow ray (4 shadow samples per cloud sample):
And here’s with the pre-marched shadow ray added:
Here’s with no ambient attenuation:
And here’s with the pre-marched ambient occlusion added:
Because the volume resolution is so low, the baked directional shadow ray can actually be calculated in real time. This allows us to freely change the time of day while still having far extending shadows.
Also, the baked shadow ray can be used to get a (volumetric) cloud shadow perfectly matching the clouds, with a single tex3D lookup:
That’s the gist of using signed distance fields to accelerate volumetric rendering. Additionally, I’ve got some other tricks going on which speeds up the rendering and stabilizes it for VR, which I’d like to share in another post.
If you made it this far, thanks for reading and I hope you found it interesting!