An Algorithm for Mesh Simplification Based on Energy-Aware

Abstract:

Mesh simplification should not only emphasize high compression ratio, but also maximize retention of a mesh representation which is another objective of mesh compression. In one of our 3D projects, in order to pursue the optimization model display, we proposed a new mesh simplification algorithm. This article describes the algorithm based on energy-aware which used to simplify a mesh of 3D model. Our approach has two major contributions. Firstly, we used an optimization method based on energy-aware, which seeks to collect low energy value vertexes of a mesh. Vertex energy is calculated by an energy function that describes the potential energy between the vertex and its directly related vertexes in a space. Secondly, our optimization method transforms a mesh into a series of triangle stripes, and reduces low energy vertexes of those stripes effectively. The process of compression is simple, efficient and adjustable for users. From the result of experiments, we can learn that our algorithm is suitable for processing several kinds of grid, and retains the characterization from original mesh very well. Our approach solved the problem of obvious distortions of a simplified mesh of 3D model, and significantly improved the efficiency of simplification process.

• Periodical: Applied Mechanics and Materials (Volumes 543-547)
• Pages: 1757-1763
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.543-547.1757
• Online since: March 2014
• Authors: Fu Yan Liu*, Chong Yuan Fan
• Keywords: 3D Model, Energy Aware, Mesh Simplification

References

[1] Jonathan Cohen, Amitabh Varshney, Dinesh Manocha, Greg Turk, Hans Weber, Pankaj Agarwal, Frederick Brooks, and William Wright. Simplification Envelopes. Proceedings of SIGGRAPH 96 (New Orleans, LA, August 4-9, 1996). In Computer Graphics Proceedings, Annual Conference Series, 1996, ACM SIGGRAPH, pp.119-128.

DOI: 10.1145/237170.237220

[2] Deering, M.: Geometry compression. In: SIGGRAPH 95, ACM SIGGRAPH, p.13–20 (1995) e. (1995).

[3] TY Chow, Fast optical layer mesh protection using pre-cross-connected trails, F Chudak, AM Ffrench - IEEE/ACM Transactions, (2004).

DOI: 10.1109/tnet.2004.828951

[4] Peng, J., Kim, C.S., Kuo, C.C.J.: Technologies for 3d mesh compression: a survey. J. Vis. Commun. Image Represent. 16(6), 688–733 (2005).

[5] G Turán . On the succinct representations of graphs. Discrete Applied Mathematics, (1984).

[6] CL Bajaj, V Pascucci, G Zhuang. Single resolution compression of arbitrary triangular meshes with properties. Published by Elsevier Science. (1999).

DOI: 10.1109/dcc.1999.755674

[7] Z. Karni and C. Gotsman. 3d mesh compression using fixed spectral bases. June (2001).

[8] Pierre Alliez. Mathieu Desbrun. Valence-Driven Connectivity Encoding for 3D Meshes. Computer Graphics Forum, 20: 480–489.

DOI: 10.1111/1467-8659.00541

[9] Shai Avidan, Ariel Shamir. Seam Carving for Content-Aware Image Resizing. ACM SIGGRAPH 2007 Article NO. 10.

DOI: 10.1145/1275808.1276390

[10] TAO Zhiliang, Pan Z. P, Shi j. y. Meshi Simplification Algorithm Based on Energy Evaluation And Its Application. 1997 volume8. 881-888.