We propose a novel approach to automatically fill holes in triangulated models. Each hole is filled using a minimum energy surface that is obtained in three steps. First, we unfold the hole boundary onto a plane using energy minimization. Second, we triangulate the unfolded hole using a constrained Delaunay triangulation. Third, we embed the triangular mesh as a minimum energy surface in ℝ3. When embedding the triangular mesh, any energy function can be used to estimate the missing data. We use a variational multi-view approach to estimate the missing data. The running time of the method depends primarily on the size of the hole boundary and not on the size of the model, thereby making the method applicable to large models. Our experiments demonstrate the applicability of the algorithm to the problem of filling holes bounded by highly curved boundaries in large models.

, ,
International Journal of Shape Modeling
School of Computer Science

Brunton, A. (Alan), Wuhrer, S. (Stefanie), Shu, C. (Chang), Bose, P, & Demaine, E. (Erik). (2010). Filling holes in triangular meshes using digital images by curve unfolding. International Journal of Shape Modeling, 16(1-2), 151–171. doi:10.1142/S0218654310001328