Jump Flooding: Voronoi in log n Passes

A Voronoi diagram and a signed distance field in log₂(n) passes — more total work than the CPU algorithm, and faster anyway.

6 tasks

1. What a Cell Has to Carry
2. One Pass, One Stride
3. The Halving Ladder
4. From Seeds to Distances
5. A Signed Distance Field From a Bitmap
6. Payoff: Measure the Lie

Start this module →

This page is an interactive exercise — the editor, the GPU runner and your saved progress need JavaScript. The text above is the full brief.