用Visual C语言实现的Delaunay三角剖分算法

An Algorithm for Delaunay Triangulation Realized with Visual C Language

描述了一种区域生长的平面Ｄｅｌａｕｎａｙ三角剖分方法，该算法首先生成一个满足条件的三角形，然后 循环扩展每一个已生成的三角形直至剖分完所有的点。由于使用了 Ｖｉｓｕａｌ Ｃ语言ＭＦＣ类进行链表的管理， 使得编程容易，整个程序简单实用。最后，给出了本算法在实际中的应用。

A region-growing algorithm for Delaunay triangulation in the plane region is proposed. With this algorithm, the triangular satisfying required conditions is firstly obtained, and then every edge of this triangular is extended circularly until all the data points is triangulated. It makes the design process easy. The programming with Visual C is relatively simple by using the MFC function to manage the lists. At last, the application of this algorithm is presented.