Dijkstra Maps

• The Incredible Power of Dijkstra Maps
  • How flood-fill algorithm works

Jump Flood Algorithm (2006)

A flooding algorithm used in the construction of Voronoi diagrams and distance transforms.

Note that the ‘Jump Flood Algorithm’ is O(N log N) where N is the number of pixels. There is a better O(N) algorithm which can be parallelized over the number of rows/columns of an image, Unfortunately, it requires random access writes. - HN

Ressource

• BoxBlur.h - Fastest CPU (AVX/SSE) implementation of a 128-pixel Box Blur.

• algorithm
  • scanline fill
    • Collaborative Diffusion: Programming Antiobjects

• Gamasutra

• pather - Collaborative diffusion path finding.
• Pathfinding Using Collaborative Diffusion