中文摘要：

本文在Delaunay-三角网的特性及其生成算法基础上，针对分割一归并算法、逐点插入法的局限性，在生长算法的基础上提出一种改进生长算法，随着Delaunay-三角网生成过程，该算法通过设置动态点链表，使点链表中的可用点逐渐减少从而节省时间，其次针对原算法中三角形有两种可扩展边的可能，每次都取边表中最后压入的边为基边来生长，这样每次生长都从每一个三角形的第三条边进行生长，这样才能保证三角形生长的正确性；试验结果表明该改进生长算法相对于传统生长算法在一定程度地节省了构网的运行时间。

英文摘要：

To efficiently establish Delaunay-triangulation, the paper introduced its properties and classification algorithm and presented an improved algorithm on the base of giftwrapping algorithms for the limitation of divide-conquer and incremental algorithms. With the generative process of Delaunay, the improved algorithm instituted dynamic point-list and made the usable points decreasing and saved the time. Second, finding the last pressed edge from the edge-list and making it gifiwrapping edge, the improved algorithm made the triangle giftwrapping from the third edge against the other two possible edges. The result proved the improved that the giftwrapping algorithm was feasible.