Filling holes in triangular meshes using digital images by curve unfolding

Download
  1. (PDF, 2 MB)
  2. Get@NRC: Filling holes in triangular meshes using digital images by curve unfolding (Opens in a new window)
AuthorSearch for: ; Search for: ; Search for: ; Search for: ; Search for:
TypeArticle
Journal titleInternational Journal of Shape Modeling
Volume16
Issue1-2
Pages151171; # of pages: 21
SubjectHole Filling; Multi-view Stereo; Space Curve Unfolding
AbstractWe 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 R3. 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.
Publication date
LanguageEnglish
AffiliationNRC Institute for Information Technology; National Research Council Canada
Peer reviewedNo
NPARC number18548400
Export citationExport as RIS
Report a correctionReport a correction
Record identifierf65c8b22-7f8d-4379-8e89-167c9c842277
Record created2011-09-08
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)