一种改进的MC三维重建算法

摘要

For traditional Marching Cubes algorithm in the process of 3d reconstruction operation time is too long, low efficiency of algorithm, this paper puts forward a kind of based on golden section point Marching Cubes algorithm, using edge golden point instead of Marching Cubes algorithm of contour surface and edge node. Make public the intersection of edge and normal vector linear interpolation calculation into basic mathematical operation, and makes the calculation of the number of by 4 times reduced to 1 times. Experiments show that this algorithm is effective to reduce the operation time of the algorithm and improve the execution efficiency of the algorithm.%针对传统Marching Cubes算法在进行三维重构过程中运算时间过长、算法效率低下的问题，提出了一种基于黄金分割点的Marching Cubes算法，使用棱边的黄金分割点代替Marching Cubes算法中等值面与棱边的交点。使公共棱边的交点和法向量的线性插值计算变为基本的数学运算，并且使计算的次数由4次减少为1次。实验证明，本次算法有效减少了算法的运算时间，提高了算法的执行效率。