现代电子技术Issue(6)：28-30,35,4.
基于Quad-Edge结构的散乱点集三角剖分并行算法研究及实现
Parallel algorithm of Delaunay triangulation dividing for scattered point set based on Quad-Edge structure
摘要
Abstract
The triangulation dividing algorithm plays an important role in computational geometry,in which the efficiency and quality of triangular mesh are inseparably linked with the follow⁃up study. In this paper,the basic principle of Delaunay tri⁃angulation dividing algorithm is analyzed and the divide⁃and⁃conquer algorithm for scattered point set is investigated based on the Quad⁃Edge structure. The popular Map⁃Reduce parallel programming model is introduced to the Delaunay triangulation divid⁃ing algorithm when dealing with scattered point set. The experiment result shows the parallel triangulation dividing parallelization can improve the efficiency of this algorithm in the case of mass data by means of Map⁃Reduce Programming Model. Further⁃more,this method has good elastic capacity and the efficiency is obviously higher than another two methods,namely the divide⁃and⁃conquer algorithm based on the Quad⁃Edge structure and the Bowyer⁃Watson triangulation dividing algorithm with triangular index.关键词
Delaunay三角剖分算法/Quad-Edge/并行算法/三角网格Key words
Delaunay triangulation algorithm/Quad-Edge/parallel algorithm/triangular mesh分类
信息技术与安全科学引用本文复制引用
付剑生,马存良..基于Quad-Edge结构的散乱点集三角剖分并行算法研究及实现[J].现代电子技术,2015,(6):28-30,35,4.基金项目
教育部新世纪优秀人才支持计划（NCET-10-0702）；高等学校博士学科点专项科研基金资助课题（20110184110016）；中央高校基本科研业务费专项资金专题研究项目(SWJTU12ZT08) （SWJTU12ZT08）
