Given a grid point y ∈ G, the region {x ∈ R N : x → G = y} where f N N (x) = f (y) is known as the Voronoi cell of y. The neighbourhood graph obtained via a Delaunay triangulation is equivalent to connecting points with corresponding Voronoi cells that are adjacent in R N . Such connectivity of Voronoi cells of grid points is also known to be useful when approximating the flux of gradient paths between cells . We employ the QHull implementation of Delaunay triangulation , using the python interface provided by SciPy . Constructing the Delaunay triangulation in N -dimensions is equivalent to constructing the convex hull of the points lifted into an N + 1 dimensional paraboloid -QHull constructs the Delaunay triangulation by constructing this convex hull using the QuickHull algorithm .