主要探讨了以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

A 2D Delaunay Triangulation (DT) with incremental site insertion

vc编程读取dxf文件高程点数据，对离散点均匀化处理，并用delaunay逐点插入算法建网。-vc programming to read the dxf file elevation point data, the uniform treatment of discrete points, and delaunay incremental insertion algorithm of network construction.