应用于德劳内三角剖分的一个中生长算法，简单有效的进行三角剖分。-Used a Delaunay triangulation algorithm in growth, simple and effective for triangulation.

Delaunay triangulation is one of the most well known algorithms for space tesselation. Dynamic Delaunay triangulation, in which you can update the input points using a predefined matrice for saving points, is presented in this document.