Normal-Based Simplification Algorithm for Meshes

  • Authors:
  • Affiliations:
  • Venue:
  • TPCG '04 Proceedings of the Theory and Practice of Computer Graphics 2004 (TPCG'04)
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a new edge collapsing-based simplificationalgorithm for meshes. It is based on the variationof the vectors that are normal to faces around the collapsingedge. Its main novelty is that it uses the same criterionto choose and validate the collapsing edge. Besides, atthe best knowledge of the authors, it is the fastest simplification algorithm found in the literature using the edge collapseoperation. This simplification algorithm, in conjunctionwith 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 performanceand mesh quality.