【24h】

A Robust Hole-Filling Algorithm for Triangular Mesh

机译:三角网格的鲁棒空穴填充算法

获取原文

摘要

This paper presents a novel hole-filling algorithm that can fill arbitrary holes in triangular mesh models. First, the advancing front mesh technique is used to cover the hole with newly created triangles. Next, the desirable normals of the new triangles are approximated using our desirable normal computing schemes. Finally, the three coordinates of every new vertex are re-positioned by solving the Poisson equation based on the desirable normals and the boundary vertices of the hole. Many experimental results and error evaluations are given to show the robustness and efficiency of the algorithm.
机译:本文介绍了一种新型孔填充算法,可以填充三角网格模型中的任意孔。首先,推进前网格技术用于覆盖新创建的三角形的孔。接下来,使用我们理想的正常计算方案来近似新三角形的所需法线。最后,通过基于所需的法线和孔的边界顶点来求解泊松方程来重新定位每个新顶点的三个坐标。给出了许多实验结果和错误评估,以显示算法的稳健性和效率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号