In this chapter we will cover the routines in the
scipy.spatial module that deal with the construction of triangulations of points in spaces of any dimension, and the corresponding convex hulls. The procedure is simple; given a set of m points in the
n-dimensional space (which we represent as an m x n NumPy array), we create the
Delaunay, containing the triangulation formed by those points.
>>> data = scipy.stats.randint.rvs(0.4,10,size=(10,2)) >>> triangulation = scipy.spatial.Delaunay(data)
Delaunay class has the basic search attributes such as
points (to obtain the set of points in the triangulation),
vertices (that offers the indices of vertices forming simplices in the ...