Metody simplifikace trojúhelníkových sítí

Abstract

Simplification algorithms for 3D meshes are essential in today's world of 3D rendering. Even though the loss of information is negligible, they are able to drastically simplify the object, allowing for significantly faster rendering and reducing its storage size in computer memory. Mesh simplification enables not only more effective handling of the object, but also shorter rendering time in comparison with the original model. This bachelor thesis will focus on three selected simplification algorithms for triangular meshes – Garland-Heckbert simplification, Lindstrom-Turk simplification and spectral simplification. We will describe all three methods and derive their error metrics. Afterwards, we will compare these methods based on multiple criteria, mainly geometric appearance and spectral properties of the output mesh. Some experiments will also focus on mesh volume and boundary preservation. Last but not least, we will describe several modifications of the selected methods.