Triangular Mesh Simplification Algorithm Based on Approximate Coplanar Triangles Merging
Shouhua Luo · Computer engineering & Software · 2011
In order to simplify the enormous triangles generated by the Marching Cubes algorithm,an algorithm proposed in this paper presents the triangular mesh model simplification based on approximate coplanar triangles merging.At first,approximate coplanar triangles are merged into one big polygon according to the merge conditions.Then,fewer triangles are obtained through the new triangulation in accordance to certain rules to reach the purpose of simplification.On the premise of maximizing the image detail reservation,the algorithm can reduce the amount of triangles,improve the rendering and transmission efficiency of the image from reconstruction and save the storage space and the time for data processing.