DMCA
Efficient Decimation of Complex Triangle Meshes (1998)
| Citations: | 9 - 1 self |
BibTeX
@MISC{Campagna98efficientdecimation,
author = {Swen Campagna and Leif Kobbelt and Hans-peter Seidel},
title = {Efficient Decimation of Complex Triangle Meshes},
year = {1998}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Due to their simplicity triangle meshes are used to represent surfaces in many applications. Since the number of triangles often goes beyond the capabilities of computer graphics hardware, a large variety of mesh simplification algorithms has been proposed in the last years. In this paper we identify major requirements for the practical usability of general purpose mesh reduction algorithms. The driving idea is to understand mesh reduction algorithms as a software extension to make more complex meshes accessible with limited hardware resources. We show how these requirements can be efficiently attained and discuss implementation aspects in detail. We present a mesh decimation scheme that fulfills these design goals and which has already been evaluated by several users from different application areas. We apply this algorithm to typical meshes to demonstrate its performance. 1 Introduction Triangle meshes are a common way to represent surfaces in computer graphics and geometric modeli...
Keyphrases
efficient decimation complex triangle mesh practical usability many application software extension driving idea last year computer graphic hardware simplicity triangle mesh general purpose mesh reduction algorithm several user mesh reduction algorithm common way typical mesh computer graphic large variety design goal complex mesh discus implementation aspect limited hardware resource different application area introduction triangle mesh geometric modeli mesh simplification algorithm mesh decimation scheme major requirement
