Pixelbased KdTree Voronoi
May 2013 | By Thomas Diewald
Kd-Tree Nearest Neighbor Search done in WebGL. For each pixel, the distance to the nearest neighbor is stored in a "distance-map", which results in a voronoi-diagram. The nearest neighbor search is done in the fragment shader, using an index-pointer-based iterating routine.