Fortunes-algorithm

Python implementation of Fortune's Algorithm. Which is an algorithm for obtaining the Voronoi diagram of a set of points (in 2d). This algorithm has a worst-case complexity of $O(n \ln n)$. The file voronoi_diagram.py contains the Voronoi class which is similar to the scipy.spatial.Voronoi class. Even though the worst-case complexity is optimal, this implentation is not optimized for speed. Basically, the only reason to use the code is to get a better sense of how Fortune's Algorithm works and if you like visuals. By setting verbose=True this implementation gives a progress plot of the algorithm.