三维物体表面重建的分支处理算法研究

根据平面点集Delaunay三角剖分的特性,将Delaunay三角剖分应用到分支问题上,改进和实现了一种分支问题处理算法。将相邻层轮廓线投影到同一个剖面上形成一个带约束边的平面点集,并将它们Delaunay三角化,根据这些三角形组来生成新的轮廓线,使轮廓线一一对应。实验结果表明该算法实现的效果较符合实际情况,能有效地处理各种不同情况。

Research of branching problem algorithm in 3D object surface reconstruction

The paper applies Delaunay triangulation to branching problem according to characteristics of the Delaunay triangula- tion of constrained edge point sets,moreover,mends and implements a branching problem algorithm.This algorithm projects the neighboring section contours onto a same section which creates a constrained edge point set.Then Delaunay triangulation is ap- plied to them,new contours are created according to the result of triangulation,and forms one-to-one relation of the contours. Experiment result indicates that the algorithm accords with fact well,and can deal with a variety of situations.