Normal-based simplification algorithm for meshes

This paper presents a new edge collapsing-based simplification algorithm for meshes. It is based on the variation of the vectors that are normal to faces around the collapsing edge. Its main novelty is that it uses the same criterion to choose and validate the collapsing edge. Besides, at the best knowledge of the authors, it is the fastest simplification algorithm found in the literature using the edge collapse operation. This simplification algorithm, in conjunction with its inverse algorithm (i.e. refinement algorithm), allows the automatic creation of a multiresolution schema, i.e. a sequence of meshes at different resolutions. Additionally, it makes a good trade-off between time performance and mesh quality