A Comparison of Efficient Decimation Algorithms for Polygonal Models

In this paper, we describe two different forms of the error metric proposed in [5] for computing local geometric deviation introduced in a triangle mesh by a half-edge collapse transformation and further investigate them. Besides, we propose a modification of Multiple Choice technique (MC) [10] that is used as a decimation framework instead of greedy design technique (GD) for iterative simplification of triangle meshes. We compare various triangle mesh decimation algorithms, that use the stated error metrics to compute the geometric fidelity every time a half-edge collapse transformation is applied and employ GD approach, MC technique and its modification as decimation frameworks, with the state-of-the-art decimation algorithms. Comparison shows that the modified MC algorithm based on the stated error measure results in better quality LODs.