一种基于蚁群优化的网格分割方法

A Mesh Segmentation Method Based on Ant Colony Optimization

三维网格的理解是许多几何处理中亟待解决的重要问题,而网格分割是其中的关键步骤。为此,利用蚁群优化算法进行网格分割。将待分割网格的每个网格视为一个蚂蚁,通过蚁群优化迭代对每个网格的标签进行更新。随着蚁群优化的迭代,种子点的标签向外扩散,标签更新通过蚁群优化的更新机制进行并满足分割要求,直至达到迭代标准。蚁群优化完成后进行区域合并,将较小的区域合并成较大区域,最终完成分割。在Princeton网格数据集上的实验结果表明,与图分割方法相比,该方法能获得更高的正确率。

The understanding of 3D meshes has become an important problem to be solved in many geometric processing problems,and the mesh segmentation is the key step,therefore a novel mesh segmentation method based on Ant Colony Optimization（ACO） is proposed in this paper.Each mesh of the mesh is regarded as an ant,and the label of each grid is updated by ACO iterations.With the iteration of the ACO,the labels of the seed points spread outward and the updating of the labels is performed by the ACO mechanism while satisfying the segmentation criterion,until the iteration criteria are met.After the ACO is completed,the regions are merged and the smaller regions are merged into larger regions.The proposed method is implemented and a part of the Princeton grid data set is tested.The experimental results show that it can achieve higher accuracy compared with the graph cut segmentation method.