Improved QEM Simplification Algorithm Based on Discrete Curvature and a Sparseness Coefficient
This article contains a study and improvement of the quadric error metric (QEM) algorithm. In the process of implementing a QEM algorithm, we improved the classical QEM algorithm for the retention of thin and sharp terminals. Some scholars proposed an improvement based on discrete curvature weightin...
Saved in:
Published in | 2014 International Conference on IT Convergence and Security (ICITCS) pp. 1 - 5 |
---|---|
Main Authors | , , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.10.2014
|
Subjects | |
Online Access | Get full text |
DOI | 10.1109/ICITCS.2014.7021780 |
Cover
Summary: | This article contains a study and improvement of the quadric error metric (QEM) algorithm. In the process of implementing a QEM algorithm, we improved the classical QEM algorithm for the retention of thin and sharp terminals. Some scholars proposed an improvement based on discrete curvature weighting of the vertices, but it still has shortcomings. We suggest an improvement based on discrete curvature threshold values and a sparseness coefficient, which can work better for the retention of sharp terminals and increase the accuracy of the simplified mesh. |
---|---|
DOI: | 10.1109/ICITCS.2014.7021780 |