Poisson-driven seamless completion of triangular meshes

被引:21
作者
Centin, Marco [1 ]
Pezzotti, Nicola [1 ,2 ]
Signoroni, Alberto [1 ]
机构
[1] Univ Brescia, Informat Engn Dept DII, I-25121 Brescia, Italy
[2] Delft Univ Technol, Intelligent Syst, Comp Graph & Visualizat Grp, Delft, Netherlands
关键词
Poisson Reconstruction; Restricted Delaunay triangulation; Hole filling; Mesh completion; Geometric modeling; 3D scanning; MODELS;
D O I
10.1016/j.cagd.2015.03.006
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The production of high-quality 3D mesh models has seen important technological advancements in recent years and is increasingly becoming a crucial asset for several application domains. However, the intrinsic nature of the problem (acquisition constraints and real objects complexity) makes hole filling and mesh completion still critical tasks for the effectual finalization of the models. In this work, we propose a new solution for filling holes and gaps and for reconstructing missing parts of mesh models that is capable to guarantee the full preservation of the input mesh. On the implicit function obtained from a Poisson Reconstruction computed on a set of oriented points derived from the input mesh, we develop an interpolation method which allows a fast and continuous surface-oracle computation which is exploited to efficiently guide a restricted Delaunay triangulation. This can be used to confine the tessellation inside the holed zones, while protecting the input mesh and the boundary curves so that simple tailoring routines can merge the obtained surface-reconstruction driven patches with the input mesh without stitching artifacts. The proposed technique is versatile and evidences its effectiveness in dealing with multiple complex holes, gaps and surface blending, and it compares favorably with respect to different, and usually more specialized, hole filling and global mesh repair techniques. As a parallel benefit, we also show how the same proposed solution can be exploited as an effective and high-quality meshing or remeshing tool. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:42 / 55
页数:14
相关论文
共 40 条
  • [1] Amenta N., 2000, P 16 ANN S COMPUTATI, P213, DOI DOI 10.1145/336154.336207
  • [2] [Anonymous], P ALGORITMY
  • [3] [Anonymous], 2014, CGAL USER REFERENCE
  • [4] [Anonymous], 2005, P EUR S GEOM PROC
  • [5] [Anonymous], 1993, P 9 ANN S COMPUTATIO, DOI 10.1145/160985.161150
  • [6] Polygon Mesh Repairing: An Application Perspective
    Attene, Marco
    Campen, Marcel
    Kobbelt, Leif
    [J]. ACM COMPUTING SURVEYS, 2013, 45 (02)
  • [7] A lightweight approach to repairing digitized polygon meshes
    Attene, Marco
    [J]. VISUAL COMPUTER, 2010, 26 (11) : 1393 - 1406
  • [8] Berger M., 2014, EUROGRAPHICS star report, V1, P161, DOI DOI 10.2312/EGST.20141040
  • [9] Automatic restoration of polygon models
    Bischoff, S
    Pavic, D
    Kobbelt, L
    [J]. ACM TRANSACTIONS ON GRAPHICS, 2005, 24 (04): : 1332 - 1352
  • [10] Boissonnat J.-D., 2006, Proceedings of the Twenty-Second Annual Symposium on Computational Geometry (SCG'06), P337, DOI 10.1145/1137856.1137906