DMCA
A Comparison of Mesh Simplification Algorithms (1997)
| Venue: | Computers & Graphics |
| Citations: | 167 - 8 self |
BibTeX
@ARTICLE{Cignoni97acomparison,
author = {P. Cignoni and C. Montani and R. Scopigno},
title = {A Comparison of Mesh Simplification Algorithms},
journal = {Computers & Graphics},
year = {1997},
volume = {22},
pages = {37--54}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In many applications the need for an accurate simplification of surface meshes is becoming more and more urgent. This need is not only due to rendering speed reasons, but also to allow fast transmission of 3D models in network-based applications. Many different approaches and algorithms for mesh simplification have been proposed in the last few years. We present a survey and a characterization of the fundamental methods. Moreover, the results of an empirical comparison of the simplification codes available in the public domain are discussed. Five implementations, chosen to give a wide spectrum of different topology-preserving methods, were run on a set of sample surfaces. We compared empirical computational complexities and the approximation accuracy of the resulting output meshes. 1 Introduction Triangles are the most popular drawing primitive. They are managed by all graphics libraries and hardware subsystems, and triangular meshes are thus very common in computer graphics. Very c...
Keyphrases
mesh simplification algorithm speed reason many application sample surface hardware subsystem popular drawing primitive last year accurate simplification empirical computational complexity different topology-preserving method fundamental method wide spectrum public domain surface mesh introduction triangle output mesh fast transmission triangular mesh many different approach empirical comparison graphic library network-based application mesh simplification approximation accuracy computer graphic
