Easiest algorithm of Voronoi diagram to implement? [closed]
An easy algorithm to compute the Delaunay triangulation of a point set is flipping edges. Since a Delaunay triangulation is the dual graph of a Voronoi diagram, you can construct the diagram from the triangulation in linear time. Unfortunately, the worst case running time of the flipping approach is O(n^2). Better algorithms such as Fortune’s … Read more