3D Mesh Simplification Algorithm Based on Normal Vector and Triangle Regularity Constraints
3D mesh simplification is an important technology in computer graphics,widely used in fields such as virtual reality,game devel-opment,and computer animation.Although traditional QEM algorithms can effectively reduce the complexity of models during simplification,they have certain limitations in preserving important details and features.To solve this problem,the QEM algorithm introduces the determina-tion of the angle between the normal vectors of the triangle before and after folding,as well as the regularity of the triangle as a constraint condi-tion for edge folding.This improvement strategy aims to ensure the continuity of the visual effects of the model during the simplification process and minimize the generation of narrow triangles.Experiments were conducted on multiple 3D models,and the results showed that the improved algorithm is more effective in preserving feature points compared to traditional QEM algorithms and vertex clustering algorithms under the same simplification rate conditions,ensuring similar visual effects before and after simplification.Additionally,the improved algorithm minimizes the Hausdorff distance between the processed model mesh and the original model mesh.
国家科技期刊平台
NSTL
万方数据
