计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (2): 86-86.

• 学术探讨 • 上一篇    下一篇

基于PVM的最小权三角划分并行遗传算法研究

张冬梅,姜鹏飞,何兴恒,杨捷   

  1. 中国地质大学(武汉)计算机学院
  • 收稿日期:2006-01-19 修回日期:1900-01-01 出版日期:2007-01-11 发布日期:2007-01-11
  • 通讯作者: 张冬梅 cugzdm cugzdm

Minimum Weight Triangulation Based on the Parallel Genetic Algorithm

,,,   

  1. 中国地质大学(武汉)计算机学院
  • Received:2006-01-19 Revised:1900-01-01 Online:2007-01-11 Published:2007-01-11

摘要: 平面点集的三角划分在计算机图形学,三维可视化等领域具有广泛的应用,在许多应用中需要提供形状最优的三角划分。但该类问题推测属于NP完全问题。为了快速有效地求解最小权三角划分(MWT)问题,本文提出了一种基于PVM的并行遗传算法来近似获取全局最优解,并系统地测试了算法中一些重要的并行控制参数,包括迁移代数和节点平均负载对算法性能的影响。实验结果表明,该方法简单、可靠,大大缩短了优化过程的时间,提高获取全局最优解的概率。

关键词: 最小权三角划分, PVM, 并行遗传算法

Abstract: The triangulation of a set of points in the Euclidean plane has a wide range of applications in Computer Graphics, 3-D Visualization and so on. In most cases, the optimum triangulation is required. However, this kind of problem is conjectured to be a NP complete problem. In this paper, we try to obtain the approximate global optimum triangulation with Parallel Genetic Algorithm based on PVM. Large-scale experiments have been done to systematically test the effect of some important parallel control parameters, which include the migration generations and the average load for each processor, on the performance of the algorithm. And the experimental results show that the parallel genetic algorithm is simple and stable, and is efficient of finding an optimum solution with a high possibility.

Key words: MWT (Minimum Weight Triangulation), PVM, Parallel Genetic Algorithm