Improvement in decimation of triangle meshes for level of detail

Simplifying polygonal models to achieve a constant frame rate or to generate an ideal size of an object proportional to its viewing distance is one of the many techniques used in 3D visualizations these days. In this paper, we have selected a decimation algorithm to be further enhanced by introducing other techniques to obtain a better output. In our technique, parts of the characterization vertices are identified and further analyzed. In the boundary convex group, categorization is made whether the vertex is to be deleted or preserved. In the evaluation stage of the decimation algorithm, we use the singular value decomposition algorithm to compute the smallest eigenvector from a matrix formed from the surrounding neighboring vertices of the simple candidate vertices. Finally, in the triangulation stage, a careful and simple patching step is applied to the resulting holes so that the output would be balance in sizes. A balanced size refers to re-generating triangle-strips of similar size of the edges for a smoother model viewing.