Progressive Mesh Based On QEM Simplification Algorithm

Highly detailed geometric models are rapidly becoming common-place in computer graphics.Comparing with the traditional two-dimensional content,such as photos,video,and so on,the huge amoun-t of data of the three-dimensional model,is challenged rendering per-formance,transmission bandwidth,and storage capacities.The progressive mesh is a general-purpose triangular mesh storage and transmission scheme,including two processes of mesh compression and mesh recovery.Asymptotic meshes save compression information at each step in the grid compression process,making it possible to re-cover the original model losslessly.However,the computational process of the grid compression part of the progressive grid is more complicat-ed,which is not conducive to real-time calculation and transmission.QEM algorithm is an efficient mesh simplification method that uses quadratic error metrics to iteratively shrink vertex pairs to quickly generate a simplified version of the high-quality model.In this paper,the QEM method is used to replace the compression process in the progressive grid,which greatly improves the computational efficiency.In the process of the improved progressive mesh algorithm based on the QEM compression algorithm proposed in this paper,inheriting the advantages of the original progressive mesh.the simplified infor-mation can still be well preserved.In the process of gradual recovery of the simplified model,The splitting operation is performed sequen-tially,and finally the model is restored to its original state.The entire process can maintain the features of the original model such as color,texture,and topology,control the degree of recovery,greatly reduce the transmission,storage and rendering pressures,and has high exe-cution efficiency.It can restore the model to the desired state in an ideal time.Improve the practical application experience.