基于局部体积最大的轮廓线三维形体重构算法

The 3D Reconstruction Algorithm of Outlines Based on the Locally Greatest Volume

提出一种以局部体积最大为约束条件的轮廓线拼接算法。该算法以上下轮廓线各顶点的每次连接都保证对整个形体体积作出最大贡献为条件,以相对应的两条轮廓线线段的叉积运算值为依据,判断将要连接的两条可能跨距哪条更靠近形体的外侧,取外侧线段为拼接线段,最终完成所有轮廓线的拼接。

The paper introduced a tiling algorithm of outlines taking the locally greatest volume as a constraint condition.Taking every connection of vertexes in outlines up and down which make the maximum contribution to the whole volume as a condition,and the operation values of crossed products of corresponding segments in outlines as a basis,the algorithm takes the outside segment as tiling segment believing that the segment is the outside one of the body in likely two spans to be connected and,at last,completing all tiling tasks of outlines.