Research Article Open Access

Mesh Simplification by Curvature-Enhanced Quadratic Error Metrics

Paolo Pellizzoni1 and Gianpaolo Savio1
  • 1 University of Padua, Italy
Journal of Computer Science
Volume 16 No. 8, 2020, 1195-1202

DOI: https://doi.org/10.3844/jcssp.2020.1195.1202

Submitted On: 8 May 2020
Published On: 7 September 2020

How to Cite: Pellizzoni, P. & Savio, G. (2020). Mesh Simplification by Curvature-Enhanced Quadratic Error Metrics. Journal of Computer Science, 16(8), 1195-1202. https://doi.org/10.3844/jcssp.2020.1195.1202

Abstract

Polygonal meshes have a significant role in computer graphics, design and manufacturing technology for surface representation and it is often required to reduce their complexity to save memory. An efficient algorithm for detail retaining mesh simplification is proposed; in particular, the method presented is an iterative edge contraction algorithm based on the work of Garland and Heckberts. The original algorithm is improved by enhancing the quadratic error metrics with a penalizing factor based on discrete Gaussian curvature, which is estimated efficiently through the Gauss-Bonnet theorem, to account for the presence of fine details during the edge decimation process. Experimental results show that this new algorithm helps preserve the visually salient features of the model without compromising performance.

Download

Keywords

  • Mesh Simplification
  • Discrete Curvature
  • Computational Geometry