A robust hole-filling algorithm for triangular mesh
Wei Zhao, Shuming Gao, Hongwei Lin
In The Visual Computer, 23(12), December 2007.
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.
Keyword(s): Hole-filling, Poisson equation, Harmonic Function, Triangular mesh
@article{Zhao:2007:ARH,
author = {Wei Zhao and Shuming Gao and Hongwei Lin},
title = {A robust hole-filling algorithm for triangular mesh},
journal = {The Visual Computer},
volume = {23},
number = {12},
pages = {987--997},
month = dec,
year = {2007},
}
Return to the search page.
graphbib: Powered by "bibsql" and "SQLite3."