Quadratic error metric mesh simplification algorithm based on discrete curvature

24Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Yao, L., Huang, S., Xu, H., & Li, P. (2015). Quadratic error metric mesh simplification algorithm based on discrete curvature. Mathematical Problems in Engineering, 2015. https://doi.org/10.1155/2015/428917

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free