基于BPLI从二维平行轮廓线重建三维表面的新算法

New Algorithms Based on BPLI Solution for Reconstructing 3-D Surfaces from Parallel Contours

系统分析了BPLI方法的基本原理 ,在保持BPLI解决分支问题和对应问题的优越性的基础上提出系列新算法 :首先提出一种新的轮廓线分段匹配算法 ,简化了轮廓线细化工作并提高了匹配效果 ;其次 ,提出一种求解空间多边形三角剖分的新算法 ,消除了退化区域。这些工作还使得新算法进行三维表面重构有效地提高了计算效率。

The correspondence and branching problems are vexed problems when reconstructing 3-D surfaces from 2-D parallel contours.BPLI tries to reconstruct non-intersecting surfaces from arbitrary input set of contours and latch a lambent solution of the two problems;however,BPLI remains the shortages of producing degenerate portions and involving time-consuming operations.After an overall analysis of BPLI,this paper proposed a series of new algorithms to improve BPLI approach:first,we proposed a new contour matching algorithm so that the correct similar contour portions of each pair of adjacent slices can be found though the contours are not finely segmented.Secondly,we triangulate the unmatched portions with a new dynamic programming scheme,which has ability to handle degenerate portions in the mesh.These improvements result in a fast triangulating process.