Skip to main content

Vertex Mesh Simplification Algorithm Based on Curvature and Distance Metric

  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((TEDUTAIN,volume 9292))

Abstract

In traditional edge collapse simplification algorithms are mostly using the Quadric Error Metrics (QEM) as the cost to carry out edge collapse simplification, these methods will lose the original model shape feature; the simplified algorithm based on Vertex Curvature can preserve model shape feature, but the error between its folded model and original model can’t be controlled well. This article plans to combine the advantages of these two methods, propose a novel vertex mesh simplification algorithm based on curvature and distance metric, using vertex curvature on the boundary type classification, get the alternative vertex of the folded edge through the LOOP subsidiary patterns, According to folding cost which is the distance metric from alternative vertex to adjacent triangle to simplify the complex mesh. In our method, those edges whose two vertex are all in the curvature threshold are marked foldable, and the less the cost, the first to fold. Compared with the simplification algorithm based on butterfly pattern, the experimental results show that this algorithm can preserve the model shape feature better.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Zhou, K., Pan, Z.G., Shi, J.Y.: Mesh simplification algorithm based on triangle collapse. Chin. J. Comput. 21(6), 506–513 (1998)

    MathSciNet  Google Scholar 

  2. Zhu, R., Shen, W.: Edge collapse considering triangular mesh for model simplification. In: Yin, Z., Pan, L., Fang, X. (eds.) Proceedings of the Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA 2013), vol. 212, pp. 1175–1181. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  3. Li, W., Chen, Y., Wang, Z., Zhao, W., Chen, L.: An improved decimation of triangle meshes based on curvature. In: Miao, D., Pedrycz, W., Slezak, D., Peters, G., Hu, Q., Wang, R. (eds.) RSKT 2014. LNCS, vol. 8818, pp. 260–271. Springer, Heidelberg (2014)

    Google Scholar 

  4. Vidal, V., Wolf, C., Dupont, F.: Combinatorial mesh optimization. Vis. Comput. 28(5), 511–525 (2012)

    Article  Google Scholar 

  5. Garland, M., Heckbert, P.S.: Surface simplification using quadric error metrics. Comput. Graph. 31(3), 209–216 (1997)

    Google Scholar 

  6. Guezier: Surface Simplification Inside a Tolerance Volume. IBM Research Report Computer Science/Mathematics, 1-56, RC 20440 (1996)

    Google Scholar 

  7. Hoppe, H.: Mesh optimization. Comput. Graph. 27(1), 19–26 (1993)

    Google Scholar 

  8. IsLer, V., Lau, R.W.H., Mark, G.: Real-time multi-resolution modeling for complex virtual environments. In: Symposium on Virtual Reality Software and Technology, Hong Kong, pp. 11–19. ACM Press (1996)

    Google Scholar 

  9. Lu, S.M., Yang, X.N., Wang, G.Z.: Edge collapse mesh simplification algorithm based on discrete curvature. J. ZheJiang Univ. 31(3), 297–299 (2004)

    Google Scholar 

  10. Schroeder, W.J., Zarge, J.A., Lorensen, W.E.: Decimation of triangle mesh. ACM Comput. Graph. 26(2), 65–70 (1992)

    Article  Google Scholar 

  11. Hamann, B.: A data reduction scheme for triangulated surfaces. Comput. Aided Geometric Des. 11(2), 197–214 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kim, S.J., Kim, C.H., Levin, D.: Surface simplification using a discrete curvature norm. Comput. Graph. 26, 657–663 (2002)

    Article  Google Scholar 

  13. Loop, C.T.: Smooth Subdivision Surfaces Based on Triangles. Department of Mathematics, The University of Utah (1987)

    Google Scholar 

Download references

Acknowledgments

This work was partly supported by National Natural Science Foundation of China (61173123), Zhejiang Provincial Natural Science Foundation of China (Z1090630, LY12F02012), Science Foundation of Chinese University (2012FZA5013) and Zhejiang Province Community Technology Research Projects (2014C31084). We are grateful to the anonymous referees for their insightful comments and suggestions, which clarified the presentation.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yunliang Jiang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Jiang, Y., Nie, W., Tang, L., Liu, Y., Liang, R., Hao, X. (2016). Vertex Mesh Simplification Algorithm Based on Curvature and Distance Metric. In: Pan, Z., Cheok, A., Müller, W., Zhang, M. (eds) Transactions on Edutainment XII. Lecture Notes in Computer Science(), vol 9292. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-50544-1_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-50544-1_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-50543-4

  • Online ISBN: 978-3-662-50544-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics