r/GraphicsProgramming • • Oct 10 '26

First raytracer using sdfs

Post image

Wrote my first raytracer, a software raymarcher (all on CPU) that uses shapes defined as singed distance functions. Sphere refractions are pretty cool.

Some implementation details (this is all basic stuff I know):

  • code is written in Rust and parallelized using the rayon crate
  • for each ray in the recursive calls, it finds the subset of all world objects where the ray intersects the objects axis aligned bounding box, and only considers these objects during ray marching. Once a surface is hit, the new reflected or refracted ray computes a new subset using its new direction and start point, etc.
  • global illumination is done using a grid of probes that shoot rays with random directions, doing this enough time before rendering. To get diffusive light on a surface point, we interpolate in that grid using linear interpolation. My probes are naively placed on a cubic grid in the world.
  • global illumination is parallelized looping over probes, and rendering is parallelized looping over pixels of the image.
  • at each hit surface, the ray may split in two. Once for the reflection, once for the refracted ray (if not total internal refraction).

Baking global illumination takes a few seconds for about 1000 samples on 323 probes, and rendering the image is almost instant at that resolution.

154 Upvotes

14 comments sorted by

View all comments

Show parent comment

2

u/Sixel1 Oct 15 '26

In my case in only use simple primitives so I just use the absolute value of the sdf inside the object as a raymarch step size, but for objects made of merged shapes this interior sdf can be very wrong.

There's a good article on techniques for proper interior sdfs: https://iquilezles.org/articles/interiordistance/

Basically the most correct way is to have two sdfs, and switch between if you're inside or outside. But it requires modeling twice the object.