Key points are not available for this paper at this time.
With the improvement of mesh accuracy, the amount of data generated by it is increasing. However, existing computer hardware cannot meet the real-time rendering requirements for high-precision meshes. Therefore, it is necessary to simplify the meshes. Traditional mesh simplification algorithms often result in feature loss and cannot effectively maintain the visual quality of simplified mesh. To address these issues, we proposes a mesh simplification algorithm that can preserve visual quality. Firstly, we analyze methods for calculating local roughness. Secondly, we introduce Laplacian matrix to aggregate the local roughness of neighboring vertices in each vertex's region. The purpose is to make the differences between vertices more distinct. Additionally, a series of constraint factors are added during the simplification process to retain more high-quality triangles. Lastly, we improve the formula for triangle collapse error and demonstrate through experiments that our proposed algorithm is effective.
Gong et al. (Thu,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: