任意平面域上离散点集的三角化方法

Triangulation Algorithm of Scattered Data on Arbitrary Planar Domain

本文提出了一种快速、有效的三角化算法，实现了任意平面域上散乱数据的三角化，生成的网络符合Ｄｅｌａｕｎａｙ准则，网格的优化是在网格生成过程中完成的，算法复杂度与点数呈近似线性关系．该算法运用于石油地质勘探领域，成功地解决了包含复杂断层的大规模数据点的三角化问题．

A fast and efficient triangulation algorithm is presented in this paper. The scattered data on any 2D shape is triangulated by this algorithm. Triangular mesh optimization is done at the same time with mesh creating. The resulted mesh is fit to Delaunay criteria. The algorithm complexity is about linear to the number of points. Application in oil and geology exploration, the algorithm can deal with large scale scattered data including complicated faults.