A hole-filling algorithm for triangular meshes

Update item information
Publication Type technical report
School or College College of Engineering
Department Computing, School of
Program Advanced Research Projects Agency
Creator Cohen, Elaine
Other Author Tekumalla, Lavanya Sita
Title A hole-filling algorithm for triangular meshes
Date 2004-12-20
Description Data obtained by scanning 3D models typically contains missing pieces and holes. These can be caused due to scanning artifacts or artifacts in the surface due to wear and tear. We provide a method based on the Moving Least Squares projection to fill holes in triangular meshes obtained during the process of surface reconstruction . Our method can be applied to holes with non-planar geometry as well as small, planar holes.
Type Text
Publisher University of Utah
Subject Hole-filling algorithm; Triangular meshes; 3D models; Scanning
Subject LCSH Three-dimensional imaging
Language eng
Bibliographic Citation Tekumalla, Lavanya Sita; Cohen, Elaine (2004). A hole-filling algorithm for triangular meshes. UUCS-04-019.
Series University of Utah Computer Science Technical Report
Relation is Part of ARPANET
Rights Management ©University of Utah
Format Medium application/pdf
Format Extent 555,899 bytes
Source University of Utah School of Computing
ARK ark:/87278/s6dn4psw
Setname ir_uspace
Date Created 2012-06-13
Date Modified 2015-04-22
ID 707537
Reference URL https://collections.lib.utah.edu/ark:/87278/s6dn4psw
Back to Search Results