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 visualisations these days. Many different algorithms are discovered to treat various types of triangle meshes possible. This is because researchers are always frantic between the rendering speed and the visual quality for generating instant and realistic output, for the two criterions are always resisting each other. In this paper, we have selected 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. For instance, the Boundary Vertex could be further divided into groups of Boundary Convex Vertices and Boundary Concave Vertices. In Boundary Convex group, categorisation is made to whether if the vertex shall be deleted or preserved. In the evaluation stage of the decimation algorithm, we use SVD algorithm to compute the smallest eigenvector from a matrix formed of the surrounding neighbouring vertices of the Simple Candidate Vertices. Lastly in 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.