一个实用的构建任意地表区域三角网的算法

A Practical Algorithm of Triangulation Set up at Arbitrary Terrains

文中提出了一个由任意地表区域(简单多边形)离散数据点构建地面三角网的实用简单的算法。该算法基于贪 心法平面点集的三角剖分,可以处理任意简单多边形区域(有若干孔或无孔的凸、凹多边形区域),并且极易推广应用到区域嵌套组合等复杂情形。

simple and practical algorithm of triangulation terrain is elaborated in the paper. This algorithm is theoretically based on Triangulation in planar set of points of Greedy Heuristic. It can be usedto treat arbitrary sample polygonal domains. it is easy for the algorithm to be extensively applied to complexly nested domains (Zhang Liang et al).