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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Schroeder, W.J., et al.: Decimation of triangle meshes. Computer Graphics 26(2), 65–70 (1992)
Cohen, J., Varshney, A., Manocha, D., et al.: Simplification Envelopes. Computer Graphics, 119–128 (1996)
Soucy, M., Laurendeau, D.: Multiresolution Surface Modeling Based on Hierarchical Triangulation. Computer Vision and Image Understanding 63(1), 1–14 (1996)
Hoppe, H.: Progressive meshes. Computer Graphics 30(1), 99–108 (1996)
Garland, M.: Quadric-based polygonal surface simplification (Ph D dissertation). Carnegie Mellon University, Pittsburgh (1999)
Gui-qing, L., Xian-min, L., Hua, L.: Mesh simplification based subdivision. In: Pan, Y. (ed.) Proceedings of the 2nd International Conference on Computer-Aided Industrial Design and Conceptual Design, pp. 351–355. International Academic Publishers, Bangkok (1999)
Sun-Jeong, K., Chang-Hun, K., Levin, D.: Surface simplification using a discrete curvature norm. Computer & Graphics 26(5), 657–663 (2002)
Hamann, B.: A Data Reduction Scheme for Triangulated Surface. Computer Aided Geometric Design 11(2), 197–214 (1994)
Isler, V., et al.: Real-Time Multi-resolution Modeling for Complex Virtual Environments. In: Mark, G. (ed.) Proceedings of the TRST 1996, pp. 11–20. ACM press, Hong Kong (1996)
Gieng, T., Hamann, B., et al.: Smooth Hierarchical Surface Triangulations. In: Yagel, R., Hagen, H. (eds.) Proceedings of the IEEE Visualization 1997, pp. 379–386. IEEE Computer Society Press, San Francisco (1997)
Zhigeng, P., Kun, Z., Jiaoying, S.: A New Mesh Simplification Algorithm Based on Triangle Collapses. Journal of Computer Science and Technology 16(1) (2001)
Wu, J.-H., et al.: An Effective Feature-preserving Mesh Simplification Scheme Based on Face Constriction. In: Proceedings of Pacific Graphics, pp. 12–21 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, Hh., Luo, Xn., Ling, Rt. (2006). Mesh Simplification Algorithm Based on N-Edge Mesh Collapse. In: Pan, Z., Cheok, A., Haller, M., Lau, R.W.H., Saito, H., Liang, R. (eds) Advances in Artificial Reality and Tele-Existence. ICAT 2006. Lecture Notes in Computer Science, vol 4282. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11941354_79
Download citation
DOI: https://doi.org/10.1007/11941354_79
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49776-9
Online ISBN: 978-3-540-49779-0
eBook Packages: Computer ScienceComputer Science (R0)