loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Theory and Practice of Computer Graphics 2004 (TPCG'04)
Normal-Based Simplification Algorithm for Meshes
Bournemouth, United Kingdom
June 08-June 10
ISBN: 0-7695-2137-1
Frutuoso G. M. Silva, University of Beira Interior - Portugal
Abel J. P. Gomes, University of Beira Interior - Portugal
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.
Citation:
Frutuoso G. M. Silva, Abel J. P. Gomes, "Normal-Based Simplification Algorithm for Meshes," tpcg, pp.211-218, Theory and Practice of Computer Graphics 2004 (TPCG'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.