An Optimisation-Based Approach to Mesh Smoothing: Reformulation and Extensions

  • Authors:
  • Yskandar Hamam;Michel Couprie

  • Affiliations:
  • F'SATIE at Tshwane University of Technology, Pretoria, RSA, and ESIEE, France;Université Paris-Est, Laboratoire d'Informatique Gaspard Monge, Equipe A3SI, ESIEE,

  • Venue:
  • GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Laplacian approach, when applied to mesh smoothing leads in many cases to convergence problems. It also leads to shrinking of the mesh. In this work, the authors reformulate the mesh smoothing problem as an optimisation one. This approach gives the means of controlling the steps to assure monotonic convergence. Furthermore, a new optimisation function is proposed that reduces the shrinking effect of the method. Examples are given to illustrate the properties of the proposed approches.