BibTeX
@inproceedings{KCS-gi98, title = {A General Framework for Mesh Decimation}, author = {Leif Kobbelt and Swen Campagna and Hans-Peter Seidel}, booktitle ={Proceedings of the Graphics Interface 1998 Conference, June 18-20, 1998, Vancouver, BC, Canada}, year = {1998}, month = {June}, pages = {43--50}, url = {http://graphicsinterface.org/wp-content/uploads/gi1998-6.pdf} }
Abstract
The decimation of highly detailed meshes has emerged as an important issue in many computer graphics related fields. A whole library of different algorithms has been proposed in the literature. By carefully investigating such algorithms, we can derive a generic structure for mesh reduction schemes which is analogous to a class of greedy-algorithms for heuristic optimization. Particular instances of this algorithmic template allow to adapt to specific target applications. We present a new mesh reduction algorithm which clearly reflects this meta scheme and efficiently generates decimated high quality meshes while observing global error bounds.