# Jump Flooding: Voronoi in log n Passes

*Module of the free GPU.js GPGPU course · 6 tasks*

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

## Tasks

1. [What a Cell Has to Carry](https://gpu.rocks/learn/jump-flooding-a741a650/1.md)
2. [One Pass, One Stride](https://gpu.rocks/learn/jump-flooding-a741a650/2.md)
3. [The Halving Ladder](https://gpu.rocks/learn/jump-flooding-a741a650/3.md)
4. [From Seeds to Distances](https://gpu.rocks/learn/jump-flooding-a741a650/4.md)
5. [A Signed Distance Field From a Bitmap](https://gpu.rocks/learn/jump-flooding-a741a650/5.md)
6. [Payoff: Measure the Lie](https://gpu.rocks/learn/jump-flooding-a741a650/6.md)

---

Interactive version: https://gpu.rocks/learn/jump-flooding-a741a650