quadric error metric
Recently Published Documents


TOTAL DOCUMENTS

14
(FIVE YEARS 0)

H-INDEX

3
(FIVE YEARS 0)

2020 ◽  
Vol 109 ◽  
pp. 101062 ◽  
Author(s):  
Anahid Ghazanfarpour ◽  
Nicolas Mellado ◽  
Chems E. Himeur ◽  
Loïc Barthe ◽  
Jean-Pierre Jessel

2016 ◽  
Vol 11 (3) ◽  
pp. 471-478 ◽  
Author(s):  
Yongxia Zhang ◽  
Long Ma ◽  
Yuanfeng Zhou ◽  
Caiming Zhang

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Li Yao ◽  
Shihui Huang ◽  
Hui Xu ◽  
Peilin Li

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.


2012 ◽  
Vol 263-266 ◽  
pp. 2320-2323 ◽  
Author(s):  
Ying Gao ◽  
Rui Zhao Wang ◽  
Jue Yuan

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.


Sign in / Sign up

Export Citation Format

Share Document