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.
翻译：March Cube 算法是目前最受欢迎的 3D 重建表面算法之一。 它通过输入图像组成立方体形体, 然后通过 15 个基本的表层配置来提取 voxel 中的等表层。 它以曲折的方式处理每个立方体体体形, 但是它不考虑相邻立方体中的等表层之间的关系。 由于模糊不清, 最后重建的模型可能有洞。 我们根据边际增长提出立方体立方体算法。 算法首先提取种子三角形, 然后种植种子三角形, 并重建整个 3D 模型。 根据生长边缘的位置, 我们提出17个等地形形形配置。 从重建结果来看, 算法可以很好地重建 3D 模型 。 当仅需要组织 3D 模型的主轮廓时, 算法效果很好 。 此外, 当数据中存在多个分散部分时, 算法只能提取与种子相关的部分的 3D 轮廓 。
相关内容
微信扫码咨询专知VIP会员