Half Edge Collapse Mesh Simplification Algorithm Based on Constrained Quadric Error Metric Method (HECMSA-CQEM)for Model Simplification

2012 ◽  
Author(s):  
Yun Liu ◽  
Yun-Jia Wang ◽  
Yuan-Yuan Lin ◽  
Li-Zong Li ◽  
Chun-Yan Qi
Keyword(s):  
Mesh Simplification ◽  
Model Simplification ◽  
Error Metric ◽  
Edge Collapse ◽  
Quadric Error Metric

Interest Points Guided Mesh Simplification

2012 ◽  
Vol 263-266 ◽  
pp. 2320-2323 ◽  
Author(s):  
Ying Gao ◽  
Rui Zhao Wang ◽  
Jue Yuan
Keyword(s):  
Mesh Simplification ◽  
Experimental Results ◽  
Interest Point ◽  
Interest Points ◽  
Interest Point Detection ◽  
Feature Preserving ◽  
Error Metric ◽  
Point Detection ◽  
Quadric Error Metric

Based on interest point detection, a feature preserving mesh simplification algorithm is proposed. The Harris operator values of all vertices in the mesh were computed firstly. On the base of Garland’s simplification algorithm, we combine the Harris operator value with quadric error metric and change the order of edge collapsing in the simplification. The experimental results show that the proposed algorithm is effective and feature preserving.

scholarly journals Quadratic Error Metric Mesh Simplification Algorithm Based on Discrete Curvature

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Li Yao ◽  
Shihui Huang ◽  
Hui Xu ◽  
Peilin Li
Keyword(s):  
Computer Graphics ◽  
Mesh Simplification ◽  
Quadratic Error ◽  
Topology Structure ◽  
Discrete Curvature ◽  
And Topology ◽  
Complex Models ◽  
Error Metric ◽  
Polygon Meshes ◽  
Quadric Error Metric

Complex and highly detailed polygon meshes have been adopted for model representation in many areas of computer graphics. Existing works mainly focused on the quadric error metric based complex models approximation, which has not taken the retention of important model details into account. This may lead to visual degeneration. In this paper, we improve Garland and Heckberts’ quadric error metric based algorithm by using the discrete curvature to reserve more features for mesh simplification. Our experiments on various models show that the geometry and topology structure as well as the features of the original models are precisely retained by employing discrete curvature.

Research on Triangular Mesh Simplification Algorithm of Virtual Object Model

2012 ◽  
Vol 271-272 ◽  
pp. 1410-1414 ◽  
Author(s):  
Yang Ping Wang ◽  
Jian Wu Dang ◽  
Jin Yu Yang ◽  
Song Wang
Keyword(s):  
Triangular Mesh ◽  
Mesh Simplification ◽  
Virtual Object ◽  
Object Model ◽  
Model Simplification ◽  
Model Quality ◽  
Weight Calculation ◽  
Edge Surface

To improve the model quality of mesh simplification, reduce the model deformation and the lost of the detail characteristics with multiple folding, the paper represents a triangular mesh simplification algorithm based on edge-surface folding. The algorithm introduces curvature characteristics of model vertexes into the weight calculation of effective points, and introduces weight of triangular facets at the same time. The facets with the smallest weight adjacent the candidate edge is shrunk. The experiment results show that the algorithm has provided a higher quality of model simplification and effectively kept the graphic features.

3D mesh simplification with feature preservation based on Whale Optimization Algorithm and Differential Evolution

2020 ◽  
Vol 27 (4) ◽  
pp. 417-435 ◽  
Author(s):  
Yaqian Liang ◽  
Fazhi He ◽  
Xiantao Zeng
Keyword(s):  
Differential Evolution ◽  
Optimization Algorithm ◽  
Approximation Error ◽  
Mesh Simplification ◽  
Whale Optimization Algorithm ◽  
Geometric Feature ◽  
3D Mesh ◽  
Feature Preservation ◽  
Whale Optimization ◽  
Edge Collapse

Large-scale 3D models consume large computing and storage resources. To address this challenging problem, this paper proposes a new method to obtain the optimal simplified 3D mesh models with the minimum approximation error. First, we propose a feature-preservation edge collapse operation to maintain the feature edges, in which the collapsing cost is calculated in a novel way by combining Gauss curvature and Quadratic Error Metrics (QEM). Second, we introduce the edge splitting operation into the mesh simplification process and propose a hybrid ‘undo/redo’ mechanism that combines the edge splitting and edge collapse operation to reduce the number of long and narrow triangles. Third, the proposed ‘undo/redo’ mechanism can also reduce the approximation error; however, it is impossible to manually choose the best operation sequence combination that can result in the minimum approximation error. To solve this problem, we formulate the proposed mesh simplification process as an optimization model, in which the solution space is composed of the possible combinations of operation sequences, and the optimization objective is the minimum of the approximation error. Finally, we propose a novel optimization algorithm, WOA-DE, by replacing the exploration phase of the original Whale Optimization Algorithm (WOA) with the mutate and crossover operations of Differential Evolution (DE) to compute the optimal simplified mesh model more efficiently. We conduct numerous experiments to test the capabilities of the proposed method, and the experimental results show that our method outperforms the previous methods in terms of the geometric feature preservation, triangle quality, and approximation error.

Mesh simplification algorithm based on edge curvature metrics and local optimization

2020 ◽  
Vol 11 (01) ◽  
pp. 1950042
Author(s):  
Jun Huang ◽  
Xiuhui Wang ◽  
Jun Wang
Keyword(s):  
Large Scale ◽  
Triangular Mesh ◽  
Small Error ◽  
Mesh Simplification ◽  
Mesh Model ◽  
Execution Speed ◽  
Edge Collapse ◽  
Approximate Measurement ◽  
Improved Algorithm

Aiming at the problem that the mesh simplification algorithm loses the geometric features of the model in large-scale simplification, an improved half-edge collapse mesh simplification algorithm is proposed. The concept of approximate measurement of edge curvature is introduced, and the edge curvature is added to the error measure, so that the order of half-edge collapse of the mesh is changed, and the simplified details of the mesh model can be preserved accurately. At the same time, by analyzing the quality of simplified triangular mesh, optimizing triangular mesh locally, reducing the amount of narrow triangles, the quality of the simplified model is improved. The proposed algorithm was tested on Cow model, Car model and Bunny model, and compared with another three algorithms, one of them is a classical mesh simplification algorithm based on edge collapse, the other is an improved algorithm of the classical one. The experimental results show that the improved algorithm can better retain the detail features of the original model at the same reduction ratio, and has reasonable mesh allocation, fast execution speed and small error.

Sign in / Sign up

Export Citation Format

Share Document