Voronoi diagrams and Delaunay triangulation#
Nearest-site partitions and empty-circumcircle triangulations, both via scipy’s Qhull wrapper.
Voronoi diagrams: every location goes to its nearest site
Voronoi diagrams: every location goes to its nearest site
Delaunay triangulation: empty circumcircles and fat triangles
Delaunay triangulation: empty circumcircles and fat triangles