【摘要】 本文设计了一种逐点加入一局部换边法，提出并证明了二维约束边在约束Ｄｅｌａｕｎａｙ三角化中存在的条件，并据４匕用中点加点法实现了二维任意域的Ｄｅ．ｌａｕｎａｙ三角剖分，生成的网格均符合Ｄｅｌａｕｎａｙ优化准则，网格的优化在网格生成过程中完成，算法复杂度与点数呈近似线性关系，给出了算法在平面域剖分和包含复杂断层的石油地质勘探散乱数据点集剖分的应用实例。更多还原

【Abstract】 A new triangulation algorithm is suggested. The prerequisite of 2D constrained edge existing in constrained Delaunay triangulation is presented and proved. Constrained Delaunay triangulation of 2D arbitrary domain is reallied by means of adding midpoints. Mesh optimization isdone with the creation of mesh. The resulted mesh meets the Delaunay criteria. The algorithmcomplexity is about linear to the number of points. Applications in oil and geology explorationshow that the algorithm can deal with scattered data with complicated faults.更多还原