Abstract
Firstly, we present a new mesh simplification algorithm. The algorithm is based on iterative half-edge contracting, and exploits a new method to measure the cost of collapse which takes the length of contracting edge and the dihedral angles between related triangles into account. The simplification does not introduce new vertex in original mesh, and enables the construction of nested hierarchies on unstructured mesh. In addition, the proposed algorithm adopts the Multiple-Choice approach to find the simplification sequence, which leads to a significant speedup with reduced memory overhead. Then we implement a mesh simplification system based on this algorithm, and demonstrate the effectiveness of our algorithm on various models.
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
Campbell, F. W., Robson, J. G.: Application of Fourier Analysis to the Visibility of Gratings. Journal of Physiology 197 (1968) 551–566
Blakemore, C., Campbell, F. W.: On the Existence of Neurons in the Human Visual System Selectively Sensitive to the Orientation and Size of Retinal Images. Journal of Physiology, 203 (1969) 237–260
Wu, J., Kobbelt, L.: Fast Mesh Decimation by Multiple-choice Techniques. In Vision, Modeling and Visualization. IOS Press (2002) 241–248
Turk, G.: Re-tilling Polygonal Surfaces. In Proceeding of ACM SIGGRAPH (1992) 55–64
Schoroeder, W.J., Zarge, J.A., Lorensen, W. E.: Decimation of Triangle Meshes. In Proc. Of ACM SIGGRAPH (1992) 65–70
Rossignac, J., Borrel, P.: Multi-resolution 3D Approximation for Rendering Complex Scenes. In Geometric Modeling in Computer Graphics Springer Verlag (1993) 455–465
Hoppe, H., DeRose, T., Duchamp, T., McDonald, J. A., Stuetzle, W.: Mesh optimization. Computer Graphics (SIG-GRAPH’ 93 Proceedings) (1993) 19–26
Hoppe, H.: Progressive Meshes. In SIG-GRAPH 96 Conference Proceeding. ACM SIGGRAPH Addison Wesley August (1996) 99–108
Cohen, J., Varshney, A., Manocha, D., Turk, G.: Simplification Envelopes. In Proc. Of ACM SIGGRAPH’ 96 (1996) 119–128
Derose, T., Lounsbery, M., Warren, J.: Multiresolution Analysis for Surfaces of Arbitrary Topology Type. Technical Report TR 93-10-05 Department of Computer Science University of Washington (1993)
Eck, M., Derose, T., Duchamp, T., Hoppe, H., Lousbery, M., Stuetzle, W.: Multiresolution Analysis of Arbitrary Meshes. In Proceeding of ACM SIGGRAPH (1995) 173–182
Garland, M., Heckbert, P. S.: Surface Simplification Using Quadric Error Metric. In Proc. SIGGRAPH’97 (1997) 209–216
Agarwal, P., Suri, S.: Surface Approximation and Geometric Partitions. In Proceedings of 5th ACM-SIAM Symposium on Discrete Algorithms (1994) 24–33
Azar, Y., Broder, A., Karlin, A., Upfal, E.: Balanced Allocations. SIAM Journal on Computing, 29(1) (1999) 180–200
Kolchin, V., Sevastyanov, B., Chist-yakov, V.: Random Allocations. John Willey & Sons (1978)
Melax, S.: A Simple, Fast, and Effective Polygon Reduction Algorithm. Game Developer November (1998) 44–49
Southern, R., Blake, E., Marais, P.: Evaluation of Memoryless Simplification. Technical Report CS01-18-00, University of Cape Town (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jia, S., Tang, X., Pan, H. (2006). Fast Mesh Simplification Algorithm Based on Edge Collapse. In: Huang, DS., Li, K., Irwin, G.W. (eds) Intelligent Control and Automation. Lecture Notes in Control and Information Sciences, vol 344. Springer, Berlin, Heidelberg . https://doi.org/10.1007/978-3-540-37256-1_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-37256-1_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37255-4
Online ISBN: 978-3-540-37256-1
eBook Packages: EngineeringEngineering (R0)