Mesh simplification algorithm based on n-edge mesh collapse

Authors:
Hua-hong Chen;Xiao-nan Luo;Ruo-tian Ling
Affiliations:
Computer Application Institute, Zhongshan University, Guangzhou, P.R. China;Computer Application Institute, Zhongshan University, Guangzhou, P.R. China;Computer Application Institute, Zhongshan University, Guangzhou, P.R. China
Venue:
ICAT'06 Proceedings of the 16th international conference on Advances in Artificial Reality and Tele-Existence
Year:
2006

Citing 9
Cited 0

Decimation of triangle meshes

SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
A data reduction scheme for triangulated surfaces

Computer Aided Geometric Design
Multiresolution surface modeling based on hierarchical triangulation

Computer Vision and Image Understanding
Progressive meshes

SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Simplification envelopes

SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Smooth hierarchical surface triangulations

VIS '97 Proceedings of the 8th conference on Visualization '97
A new mesh simplification algorithm based on triangle collapses

Journal of Computer Science and Technology
An Effective Feature-Preserving Mesh Simplification Scheme Based on Face Constriction

PG '01 Proceedings of the 9th Pacific Conference on Computer Graphics and Applications
Quadric-based polygonal surface simplification

Quadric-based polygonal surface simplification

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a method for dividing the triangle mesh into n-edge mesh and puts forward a new mesh simplification algorithm based on n-edge mesh collapse. An n-edge mesh can be in the form of an edge, a triangle or a quadrangle, it depends on the value of ‘n’. The algorithm utilizes iterative collapse of n-edge mesh to simplify meshes and the surface error approximations are maintained using quadric error metrics. There are n-1 vertices and 2(n-1) faces which have to be collapsed during every simplification, so only few collapses are need when n becomes bigger. And this means, the time of the simplification process can be reduced. Our algorithm contains Garland’s (n=2) [5] and Pan’s (n=3) [11] cases, thus it can be regarded as the summarized algorithm of mesh simplification based on the geometry element collapse. Experimental results demonstrate the different cases, which hold different values of ‘n’ in the algorithm.