Computing the Voronoi diagram of a set of points
The Voronoi diagram of a set of seed points divides space into several regions. Each region contains all points closer to one seed point than to any other seed point.
The Voronoi diagram is a fundamental structure in computational geometry. It is widely used in computer science, robotics, geography, and other disciplines. For example, the Voronoi diagram of a set of metro stations gives us the closest station from any point in the city.
In this recipe, we compute the Voronoi diagram of the set of metro stations in Paris using SciPy.
Getting ready
You need the Smopy module to display the OpenStreetMap map of Paris. You can install this package with pip install smopy.
You also need to download the RATP dataset from the book's GitHub repository at https://github.com/ipython-books/cookbook-data and extract it in the current directory. The data was obtained on RATP's open data website (Paris' public transport operator, http://data.ratp...
