News for hackers. Stuff that matters.
Re:Voronoi Tessellations by FreeFull on Monday May 29, 2017 @04:46AM (#14438129)
The article mentions Delanuay triangulation, but it doesn't mention that one way to calculate a Voronoi tesselation is to calculate the Delanuay triangulation first.
Re:Voronoi Tessellations by btschaegg on Monday May 29, 2017 @08:50AM (#14438841)
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.p...

[2]: http://www.comp.nus.edu.sg/~tants/delaunay/GPUDT.pdf

Re:Voronoi Tessellations by jayrhynas on Monday May 29, 2017 @08:23AM (#14438737)
It does however mention going the other way:

> If you create a dual graph of a Voronoi diagram (connect each node to every other node that shares an edge), you end up with a graph that is a Delaunay Triangulation

Re:Voronoi Tessellations by philipov on Monday May 29, 2017 @09:22AM (#14438947)
That's how it's done in QHull, the basis for SciPy's voronoi features.