find the Delaunay triangulation for a given list of points - Maple Help

Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : GraphTheory/DelaunayTriangulation

GraphTheory[DelaunayTriangulation] - find the Delaunay triangulation for a given list of points

 Calling Sequence DelaunayTriangulation(points)

Parameters

 points - list of 2 element lists representing n coordinates

Description

 • This function computes a Delaunay triangulation of the input points returning a sequence of two outputs: the set of triangles and an edge adjacency Matrix.
 • The Delaunay triangulation is a triangulation that maximizes the smallest angle of the triangles in the triangulation (i.e. it avoids thin triangles).
 • The triangles are returned in a set containing the three vertices of each triangle as integer references to the input points list.
 • The adjacency matrix is an n by n symmetric Matrix that contains a $1$ in entry $i,j$ if one of the triangle edges is from ${\mathrm{points}}_{i}$ to ${\mathrm{points}}_{j}$, and $0$ otherwise.