Interestingly, the reverse as also very true: A simple and rather effective method to calculate a delaunay triangulation on a set of 2D points on a GPU is to ac

Interestingly, the reverse as also very true: A simple and rather effective method to calculate a delaunay triangulation on a set of 2D points on a GPU is to actually calculate the according Voronoi diagram (discretely) into a texture (using jump flooding) and handling the edges between the cells[1][2]. [1]: http://www.cs.utah.edu/~maljovec/files/DT_on_the_GPU_Print.pdf http://www.cs.utah.edu/~maljovec/files/DT_on_the_GPU_Print.p... [2]: http://www.comp.nus.edu.sg/~tants/delaunay/GPUDT.pdf http://www.comp.nus.edu.sg/~tants/delaunay/GPUDT.pdf