Quadratic error metric mesh simplification algorithm based on discrete curvature
Summary: 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.
- Curvature-weighted surface simplification algorithm using vertex-based geometric features
- Complex model simplification algorithm with improved error evaluation
- Optimal triangulation and quadric-based surface simplification
- A mesh simplification algorithm based on quadrangle collapse
- scientific article; zbMATH DE number 2247682
- Optimal triangulation and quadric-based surface simplification
- Variational shape approximation of point set surfaces
- Reducing complexity in polygonal meshes with view-based saliency
- scientific article; zbMATH DE number 5882285 (Why is no real title available?)
- Algorithm to generate progressive meshes based on quadric error metric
- A mesh simplification algorithm based on quadrangle collapse
- Improved QEM simplification algorithm based on features preserved
- Application of discrete curvatures to surface mesh simplification and feature line extraction
- Curvature-weighted surface simplification algorithm using vertex-based geometric features
This page was built for publication: Quadratic error metric mesh simplification algorithm based on discrete curvature
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1665648)
