A mesh simplification algorithm for keeping local features with mesh segmentation

Abstract

How to keep local features of the mesh and adaptive simplification becomes the research hotspot. This paper proposes a mesh segmentation algorithm and an adaptive mesh simplification algorithm, based on quadric error metric of Garland, that can keep the triangle grid local features effectively. The algorithm introduces vertex slope as the weighted value of the basic quadric error metric. Experimental results indicate that the algorithm, not only inherits higher speed and quality of the quadric error metric algorithm, but also overcomes the shortcoming of uniform grid.