一种基于边增长的Marching Cube算法
A Marching Cube Algorithm Based on Edge Growth
摘要:
Marching Cube算法是目前最流行的三维重建面绘制算法之一。该方法通过输入图像形成立方体体素,然后利用15种基本拓扑结构提取体素中的等值面。该方法对每个立方体体素进行遍历处理,但不考虑相邻立方体中等值面之间的关系。由于模糊性,最终重建的模型可能有洞。提出了一种基于边生长的Marching Cube算法。该算法首先提取种子三角形,然后生长种子三角形和重建整个三维模型。根据生长边的位置,我们提出了17种具有等值面的拓扑构型。从重建结果来看,该算法能够很好地重建三维模型。当只需要组织3D模型的主轮廓时,该算法表现良好。此外,当数据中存在多个散乱零件时,通过设置种子所选择的区域,该算法可以只提取与种子相连的零件的三维轮廓。
英文摘要:
Marching Cube algorithm is currently one of the most popular 3D reconstruction surface rendering algorithms. It forms cube voxels through the input image, and then uses 15 basic topological configurations to extract the iso-surfaces in the voxels. It processes each cube voxel in a traversal manner, but it does not consider the relationship between iso-surfaces in adjacent cubes. Due to ambiguity, the final reconstructed model may have holes. We propose a Marching Cube algorithm based on edge growth. The algorithm first extracts seed triangles, then grows the seed triangles and reconstructs the entire 3D model. According to the position of the growth edge, we propose 17 topological configurations with iso-surfaces. From the reconstruction results, the algorithm can reconstruct the 3D model well. When only the main contour of the 3D model needs to be organized, the algorithm performs well. In addition, when there are multiple scattered parts in the data, the algorithm can extract only the 3D contours of the parts connected to the seed by setting the region selected by the seed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。