Non-iterative approach for global mesh optimization

  • Authors:
  • Ligang Liu;Chiew-Lan Tai;Zhongping Ji;Guojin Wang

  • Affiliations:
  • Department of Mathematics, Zhejiang University, Hangzhou 310027, China;Department of Computer Science, Hong Kong University of Science and Technology, Hong Kong;Department of Mathematics, Zhejiang University, Hangzhou 310027, China;Department of Mathematics, Zhejiang University, Hangzhou 310027, China

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a global optimization operator for arbitrary meshes. The global optimization operator is composed of two main terms, one part is the global Laplacian operator of the mesh which keeps the fairness and another is the constraint condition which reserves the fidelity to the mesh. The global optimization operator is formulated as a quadratic optimization problem, which is easily solved by solving a sparse linear system. Our global mesh optimization approach can be effectively used in at least three applications: smoothing the noisy mesh, improving the simplified mesh, and geometric modeling with subdivision-connectivity. Many experimental results are presented to show the applicability and flexibility of the approach.