Skip to main content
Springer Nature Link
Log in

The Triangle Collapse Algorithm Based on Angle Error Metrics

  • Conference paper
  • First Online:
Data Science (ICPCSEE 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 727))

  • 2609 Accesses

Abstract

To solve the problems in the mesh simplification, such as the poor features preserving and too uniform in some areas, an improved triangle collapse algorithm based on angle error metrics is proposed. First, divide the triangles into three types, and different processing methods are adopted for different types of triangles. The algorithm uses the triangle collapse based on the quadratic error metrics. In order to preserving the topological structure and geometric boundary feature of the original model, the angle error metrics is added as a new feature factor on the basis of the two factors: the long and narrow degree and the local region area. This algorithm is implemented by VC++6.0 and OpenGL. The experiment shows that the algorithm preserves the boundary feature and topology of the original model well, and the speed of simplification is faster than other algorithm.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Kalvin, A.D., Taylor, R.H.: Superfaces: polygonal mesh simplification with bounded error. IEEE Comput. Graph. Appl. 16(3), 64–77 (1996)

    Article  Google Scholar 

  2. William, J.S., Jonathan, A.Z., William, E.L.: Decimation of triangle meshes. Comput. Graph. 26(2), 65–70 (1992)

    Article  Google Scholar 

  3. Garland, M., Heckbert, PS.: Surface simplification using quadric error metrics. In: Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques, pp. 209–216. ACM Press, New York (1997)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Lau, W.H., Green, M.: Real-time multi-resolution modeling fore complex virtual environments. In: Proceedings of Virtual Reality Software and Technology 1996, Hongkong, pp. 11–19. ACM Press (1997)

    Google Scholar 

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

    MathSciNet  Google Scholar 

  7. Li, N., Xiao, K., Li, Y.: Improved algorithm of mesh simplification based on triangle collapse. Comput. Eng. Appl. 45(34), 192–194 (2009)

    Google Scholar 

  8. Liu, X., Liu, Z., Gao, P.: Edge collapse simplification based on sharp degree. J. Softw. 16(5), 669–675 (2005)

    Article  MATH  Google Scholar 

  9. Dong, F., Liu, Y., Xiao, R.: Improved QEM simplification algorithm based on features preserved. J. Comput. Appl. 28(8), 2040–2045 (2008)

    MATH  Google Scholar 

  10. Zhou, Y., Zhang, C., He, P.: Feature preserving mesh simplification algorithm based on square volume measure. Chin. J. Comput. 32(2), 203–212 (2009)

    Article  Google Scholar 

  11. Yong, T., Yan, X., Li, Y.: Geometry modeling for virtual reality based on CAD data. Open Cybern. Syst. J. 9(1), 2339–2343 (2015)

    Article  Google Scholar 

  12. Ali, S.K., Rahmat, R.O.K., Khalid, F., Khalil, H.H.: Rational equation for simplifying complex surfaces. Arab. J. Sci. Eng. 39(6), 4617–4636 (2014)

    Article  Google Scholar 

  13. Mao, J., Yang, J., Zhu, B., Yang, Y.: A new mesh simplification algorithm based on quadric error metrics. In: IEEE, International Conference on Consumer Electronics - Berlin, pp. 463–466. IEEE, Berlin (2008)

    Google Scholar 

Download references

Acknowledgement

This work is supported by (1) National Natural Science Foundation of China (61300122); (2) A Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions; (3) Water Science and Technology Project of Jiangsu Province (2013025).

Author information

Authors and Affiliations

  1. College of Computer and Information, Hohai University, Nanjing, 211100, China

    Xiaorong Yan, Yuansheng Lou & Ling Li

Authors
  1. Xiaorong Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuansheng Lou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ling Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaorong Yan .

Editor information

Editors and Affiliations

  1. Central South University, Changsha, China

    Beiji Zou

  2. Central South University, Changsha, China

    Min Li

  3. Harbin Institute of Technology, Harbin, China

    Hongzhi Wang

  4. Harbin University of Science and Technology, Harbin, China

    Xianhua Song

  5. Harbin University of Science and Technology, Harbin, China

    Wei Xie

  6. Harbin Sea of Clouds and Computer Technology, Harbin, China

    Zeguang Lu

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Yan, X., Lou, Y., Li, L. (2017). The Triangle Collapse Algorithm Based on Angle Error Metrics. In: Zou, B., Li, M., Wang, H., Song, X., Xie, W., Lu, Z. (eds) Data Science. ICPCSEE 2017. Communications in Computer and Information Science, vol 727. Springer, Singapore. https://doi.org/10.1007/978-981-10-6385-5_52

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-6385-5_52

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-6384-8

  • Online ISBN: 978-981-10-6385-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics