Polynomial blending in a mesh hole-filling application

  • Authors:
  • Z. Li;D. S. Meek;D. J. Walton

  • Affiliations:
  • Department of Mathematics and Science, Zhejiang Sci-Tech University, Hangzhou, 310018, China and Department of Computer Science, University of Manitoba, Winnipeg, Canada, R3T 2N2;Department of Computer Science, University of Manitoba, Winnipeg, Canada, R3T 2N2;Department of Computer Science, University of Manitoba, Winnipeg, Canada, R3T 2N2

  • Venue:
  • Computer-Aided Design
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, a feature-preserving mesh hole-filling algorithm is realized by the polynomial blending technique. We first search for feature points in the neighborhood of the hole. These feature points allow us to define the feature curves with missing parts in the hole. A polynomial blending curve is constructed to complete the missing parts of the feature curves. These feature curves divide the original complex hole into small simple sub-holes. We use the Bezier-Lagrange hybrid patch to fill each sub-hole. The experimental results show that our mesh hole-filling algorithm can effectively restore the original shape of the hole.