计算机应用研究2016，Vol.33Issue(6)：1616-1619,4.DOI:10.3969/j.issn.1001-3695.2016.06.004
面向共享内存结构的并行 DeIaunay 网格生成算法
Parallel Delaunay mesh generation algorithm for shared memory structure
摘要
Abstract
In order to suit the shared memory structure well and take advantages of the supercomputers with hybrid architec-ture,this paper proposed a parallel Delaunay mesh generation algorithm based on parallelizing the procedure of inserting points.It took fully advantages of the shared memory structure.The presented algorithm inserted points in parallel by partitio-ning the candidate point set into independent subsets,thus it could increase the number of points inserted in each iteration of parallel point insertion.It implemented the presented algorithm using OpenMP,and compared with open-source code Triangle. The experimental results show that the presented parallel algorithm can successfully divide the candidate point set into inde-pendent subsets and handle them in parallel,together with relatively good mesh quality and parallel efficiency.关键词
网格生成/Delaunay 算法/并行计算/共享内存Key words
mesh generation/Delaunay algorithm/parallel computing/shared memory分类
信息技术与安全科学引用本文复制引用
张晓蒙,陆忠华,张鉴,马文鹏..面向共享内存结构的并行 DeIaunay 网格生成算法[J].计算机应用研究,2016,33(6):1616-1619,4.基金项目
国家“863”计划资助项目（2012AA01A304）；国家自然科学基金资助项目（91130019，91330206，11271350）数学工程与先进计算国家重点实验室开放课题基金资助项目 （）
