Corresponding improvements have been made to the shortcomings of traditional mesh simplification algorithms in dealing with boundary vertices and boundary edges, progressive mesh ambiguity, and effective maintenance of mesh topological relationships. The improved mesh simplification algorithm can effectively maintain the shape characteristics of the mesh model, eliminate the ambiguity of the progressive mesh, and improve the quality of mesh simplification. In order to sort the folding errors, the minimum heap algorithm is used to improve the time efficiency of the algorithm. Experimental results show that the algorithm can produce high-quality meshes and has high execution efficiency. Keywords: edge folding; point splitting; quadratic error measure; mesh simplification
You Might Like
Recommended ContentMore
Open source project More
Popular Components
Searched by Users
Just Take a LookMore
Trending Downloads
Trending ArticlesMore