基于生长算法构建Delaunay三角网.pdfVIP

Vol21 　No12 公 　路 　交 　通 　科 　技 2004 年 12 月 JOURNAL OF HIGHWAY AND TRANSPORTATION RESEARCH AND DEVELOPMENT 文章编号 : (2004) 基于生长算法构建 Delaunay 三角网的研究 蒋红斐 , 涂 　鹏 , 李国忠 ( 中南大学土木建筑学院 , 湖南 　长沙 　410075) 摘要 : 提出了一种基于凸包构建 Delaunay 三角网的算法 , 它包括离散点数据的三角剖分及将约束边嵌入三角网。在对 离散点数据进行三角剖分时 , 首先建立一个外轮廓为凸包的初始三角网 , 然后将剩余的点依次与既有三角网合并来生 成包含所有数据点的三角网。为了将约束边嵌入三角网 , 找出约束边穿过的三角形 , 删除这些三角形并用约束边将这 些三角形所围成的多边形分成两个简单多边形 , 再对这两个简单多边形进行 Delaunay 三角网剖分即可达到嵌入约束边 的目的。 关键词 : 三角剖分 ; 凸包 ; 支撑线 中图分类号 : TP309 　　　　　　文献标识码 : A Study on Growth Algorithm for Generating Con straine d Delaunay Triangulation J IAN G Hongf ei , TU Peng , LI Guozhong (Civil Architectural College , Central South University , Hunan 　Changsha 　410075 , China) Ab stract : A algorithm for creating Delaunay Triangulation based on convex hull is presented in the paperIt includes triangulation of scattered points and inserting constrained edges into triangular meshesWhen triangulating of scattered points , the algorithm creates an initial triangular mesh the boundary of which is a convex hull , then merges the other points with the existed triangular mesh to create a triangular mesh including all data pointsIn order to insert a constrained edge into a triangular mesh , the algorithm finds out the triangles which intersect with the constrained edge , then deletes the triangles and splits the polygon which consists of the triangles into two poly gons , finally the boundary can be inserted into the triangular mesh after triangulating of the tw