Simplification Algorithm of half-edge collapse 3D Model Based on Weighted Curvature
Shiyu Lu, Huamin Yang, Han Cheng, TongTong Zhang, Yuqiang Zhang
Abstract
Shiyu Lu, Huamin Yang, Han Cheng, TongTong Zhang, Yuqiang Zhang
Abstract
Aiming at the problems of the loss of model details and poor mesh quality when the mesh simplification algorithm simplifies the 3D model, a high-quality mesh simplification algorithm that maintains the characteristics is proposed. In the process of simplification of the 3D mesh model, first of all, for the loss of detailed features of the mesh model, the discrete curvature of the vertex is introduced, and it is combined with the original error matrix to maintain the simplified model to a large extent. Detailed features: After simplification, to solve the problem of poor triangle quality, Laplacian is introduced to optimize the triangular mesh, reduce the number of long and narrow triangles, and improve the quality of the triangular mesh. The proposed algorithm not only considers the geometric characteristics, but also considers the smoothness of the mesh, making the simplified model approximate to the original model. Experimental results show that the algorithm effectively retains the detailed features and mesh smoothness, and the simplification effect is better.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Aiming at the problems of the loss of model details and poor mesh quality when the mesh simplification algorithm simplifies the 3D model, a high-quality mesh simplification algorithm that maintains the characteristics is proposed. In the process of simplification of the 3D mesh model, first of all, for the loss of detailed features of the mesh model, the discrete curvature of the vertex is introduced, and it is combined with the original error matrix to maintain the simplified model to a large extent. Detailed features: After simplification, to solve the problem of poor triangle quality, Laplacian is introduced to optimize the triangular mesh, reduce the number of long and narrow triangles, and improve the quality of the triangular mesh. The proposed algorithm not only considers the geometric characteristics, but also considers the smoothness of the mesh, making the simplified model approximate to the original model. Experimental results show that the algorithm effectively retains the detailed features and mesh smoothness, and the simplification effect is better.
Key concepts: Laplacian smoothing, Triangle mesh, T-vertices, Algorithm, Curvature, Computer science, Vertex (graph theory), Smoothness