A robust hole-filling algorithm for triangular mesh

Authors:
Wei Zhao;Shuming Gao;Hongwei Lin
Affiliations:
Zhejiang University, The State Key Lab of CAD&CG, 310027, Hang Zhou, China;Zhejiang University, The State Key Lab of CAD&CG, 310027, Hang Zhou, China;Zhejiang University, The State Key Lab of CAD&CG, 310027, Hang Zhou, China
Venue:
The Visual Computer: International Journal of Computer Graphics
Year:
2007

Citing 0
Cited 15

A Robust Method for Filling Holes in 3D Meshes Based on Image Restoration

ACIVS '08 Proceedings of the 10th International Conference on Advanced Concepts for Intelligent Vision Systems
Mixed finite element methods for geometric modeling using general fourth order geometric flows

Computer Aided Geometric Design
Fixing geometric errors on polygonal models: a survey

Journal of Computer Science and Technology
Growing self-organizing surface map: Learning a surface topology from a point cloud

Neural Computation
Polynomial blending in a mesh hole-filling application

Computer-Aided Design
Hole filling in 3D volumetric objects

Pattern Recognition
Feature suppression based CAD mesh model simplification

Computer-Aided Design
Toward an automatic hole characterization for surface correction

ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part I
Technical Section: Automatic hole-filling of CAD models with feature-preserving

Computers and Graphics
Hole filling of triangular mesh segments using systematic grey prediction

Computer-Aided Design
Accurate reconstruction of engineered models with surfaces of revolution

Proceedings of the Eighth Indian Conference on Computer Vision, Graphics and Image Processing
Polygon mesh repairing: An application perspective

ACM Computing Surveys (CSUR)
An efficient and collision-free hole-filling algorithm for orthodontics

The Visual Computer: International Journal of Computer Graphics
Context-based coherent surface completion

ACM Transactions on Graphics (TOG)
A triangulation-based hole patching method using differential evolution

Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.