Papers › Optimisations for Real-Time Volumetric Cloudscapes
Optimisations for Real-Time Volumetric Cloudscapes
Alastair Toft, Huw Bowles, Daniel Zimmermann
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Volumetric cloudscapes are prohibitively expensive to render in real time without extensive optimisations. Previous approaches render the clouds to an offscreen buffer at one quarter resolution and update a fraction of the pixels per frame, drawing the remaining pixels by temporal reprojection. We present an alternative approach, reducing the number of raymarching steps and adding a randomly jittered offset to the raymarch. We use an analytical integration technique to make results consistent with a lower number of raymarching steps. To remove noise from the resulting image we apply a temporal anti-aliasing implementation. The result is a technique producing visually similar results with 1/16 the number of steps.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections