摘要
本文通过对 Delaunay三角剖分的特性和并行性进行分析 ,提出了一种基于网格的 Delaunay三角剖分并行算法 .该算法解决了四点共圆的不唯一性及并行处理边界的任意性问题 ,在任务分配上较好地保证了负载的均衡 ,并在分布式环境中成功地实现该算法 。
This paper give a kind of Delaunay triangulation dividing parallel algorithm using a uniform grid through analysing character of Delaunay triangulation dividing. The algorithm solves a problem of four points on a circle and find a answer to uncertain border of parallel processing. The algorithm ensures load balancing on dispatching task and is executed on distributed environment, and has better effect.
出处
《小型微型计算机系统》
CSCD
北大核心
2001年第4期450-452,共3页
Journal of Chinese Computer Systems
基金
国家高性能计算基金资助项目! (项目号为 :9840 5 5 )
