A comparison of mesh simplification algorithms

In many applications the need for an accurate simplification of surface meshes is becoming more and more urgent. This need is not only clue 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 methods. were run on a set of sample surfaces. We compared empirical computational complexities and the approximation accuracy of the resulting output meshes.