Javascript must be enabled for the correct page display

Efficient Implementation of KLSDecimate: An Algorithm for Surface Simplification

Döling, C. (1999) Efficient Implementation of KLSDecimate: An Algorithm for Surface Simplification. Master's Thesis / Essay, Computing Science.

[img]
Preview
Text
Infor_Ma_1999_CDoling.CV.pdf - Published Version

Download (1MB) | Preview

Abstract

To represent 3-dimensional objects mostly triangles are used. Nowadays, the representation of these objects consists of a large amount of triangles. However, the available computing power is not always sufficient to render the model in real-time, or even visualize it in reasonable time. For such cases, algorithms exist which simplify or decimate the model. One of these decimation algorithms, by Klein, Liebich and Strailer, was already implemented. It gives better results than most other algorithms because it uses a better error metric. However, the implementation lacked a lot of speed, due to some inefficient routines and datastructures. They were replaced with more efficient ones. Also the generation of a multiresolution model (MRM) with this algorithm was studied. Suggestions for adapting the implementation to support the MRM are given.

Item Type: Thesis (Master's Thesis / Essay)
Degree programme: Computing Science
Thesis type: Master's Thesis / Essay
Language: English
Date Deposited: 15 Feb 2018 07:29
Last Modified: 15 Feb 2018 07:29
URI: http://fse.studenttheses.ub.rug.nl/id/eprint/8822

Actions (login required)

View Item View Item