A faster, recursive algorithm to render Signed Distance Fields (SDFs) using less samples?
Here's an idea I've been working on in the last few days for a way to render SDFs more efficiently using less samples. As far as I know this is novel. Very curious to hear your feedback.
GitHub repository:
https://github.com/maximecb/batchmarc...
Previous blog post on SDF optimization from 2016:
https://pointersgonewild.com/2016/05/...
On this page of the site you can watch the video online A faster, recursive algorithm to render Signed Distance Fields (SDFs) using less samples? with a duration of hours minute second in good quality, which was uploaded by the user Maxime Chevalier 06 March 2026, share the link with friends and acquaintances, this video has already been watched 1,421 times on youtube and it was liked by 35 viewers. Enjoy your viewing!
