主要探讨了以Delaunay三角剖分的逐点插入法为基础构建不规则三角网的方法,并在程序设计中对该算法进行了改进,极大地提高了Delaunay三角网的构建效率 -Mainly discusses the Delaunay triangulation based on incremental insertion method TIN constructed, and in programming the algorithm was improved greatly improve the eff