voronoi

What are the easy algorithms to implement Voronoi diagram? I couldn't find any algorithm specially in pseudo form. Please share some links of Voronoi diagram algorithm, tutorial etc. 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 line sweep exist, which take O(n log n) time. This is somewhat tricky

I'm trying to colorize a Voronoi Diagram created using scipy.spatial.Voronoi . Here's my code: import numpy as np import matplotlib.pyplot as plt from scipy.spatial import Voronoi, voronoi_plot_2d # make up data points points = np.random.rand(15,2) # compute Voronoi tesselation vor = Voronoi(points) # plot voronoi_plot_2d(vor) # colorize for region in vor.regions: if not -1 in region: polygon = [vor.vertices[i] for i in region] plt.fill(*zip(*polygon)) plt.show() The resulting image: As you can see some of the Voronoi regions at the border of the image are not colored. That is because some