Skip to main content

CPU-GPU Algorithms for Triangular Surface Mesh Simplification

  • Conference paper

Summary

Mesh simplification and mesh compression are important processes in computer graphics and scientific computing, as such contexts allow for a mesh which takes up less memory than the original mesh. Current simplification and compression algorithms do not take advantage of both the central processing unit (CPU) and the graphics processing unit (GPU). We propose three simplification algorithms, one of which runs on the CPU and two of which run on the GPU. We combine these algorithms into two CPU-GPU algorithms for mesh simplification. Our CPU-GPU algorithms are the naïve marking algorithm and the inverse reduction algorithm. Experimental results show that when the algorithms take advantage of both the CPU and the GPU, there is a decrease in running time for simplification compared to performing all of the computation on the CPU. The marking algorithm provides higher simplification rates than the inverse reduction algorithm, whereas the inverse reduction algorithm has a lower running time than the marking algorithm.

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   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Afek, Y., Gafni, E., Tromp, J., Vitany, P.: Wait-Free Test-and-Set. In: Segall, A., Zaks, S. (eds.) WDAG 1992. LNCS, vol. 647, pp. 85–94. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  2. AIM@SHAPE. Aim@shape shape repository 4.0 (February 2012), http://shapes.aimatshape.net/

  3. Algorri, M.-E., Schmitt, F.: Mesh simplification. Computer Graphics Forum 15(3), 77–86 (1996)

    Article  Google Scholar 

  4. Bajaj, C.L., Pascucci, V., Zhuang, G.: Progressive compression and transmission of arbitrary triangular meshes. In: Proc. Visualization 1999, pp. 307–537 (1999)

    Google Scholar 

  5. Brodsky, D., Pedersen, J.B.: A parallel framework for simplification of massive meshes. In: Proc. of the 2003 IEEE Symposium on Parallel and Large-Data Visualization and Graphics, PVG 2003, pp. 17–24. IEEE Computer Society, Washington, DC (2003)

    Google Scholar 

  6. Cignoni, P., Montani, C., Scopigno, R.: A comparison of mesh simplification algorithms. Computers & Graphics 22, 37–54 (1997)

    Article  Google Scholar 

  7. NVIDIA Corporation. CUDA Toolkit (January 2012), http://developer.nvidia.com/cuda-toolkit-41

  8. DeCoro, C., Tatarchuk, N.: Real-time mesh simplification using the GPU. In: Proc. of the 2007 Symposium on Interactive 3D Graphics and Games, I3D 2007, pp. 161–166. ACM, New York (2007)

    Chapter  Google Scholar 

  9. Dehne, F., Langis, C., Roth, G.: Mesh simplification in parallel. In: ICA3PP 2000, pp. 281–290 (2000)

    Google Scholar 

  10. Dick, C., Schneider, J., Westermann, R.: Efficient geometry compression for GPU-based decoding in realtime terrain rendering. Computer Graphics Forum 28(1), 67–83 (2009)

    Article  Google Scholar 

  11. Franc, M., Skala, V.: Parallel triangular mesh decimation without sorting. In: Proc. of the 17th Spring Conference on Computer Graphics, SCCG 2001, p. 22. IEEE Computer Society, Washington, DC (2001)

    Chapter  Google Scholar 

  12. Heckbert, P., Garl, M.: Multiresolution modeling for fast rendering. In: Proceedings of Graphics Interface, pp. 43–50 (1994)

    Google Scholar 

  13. Hjelmervik, J., Leon, J.-C.: GPU-accelerated shape simplification for mechanical-based applications. In: Proc. of the IEEE International Conference on Shape Modeling and Applications 2007, SMI 2007, pp. 91–102. IEEE Computer Society, Washington, DC (2007)

    Chapter  Google Scholar 

  14. Hoppe, H.: Progressive meshes. In: Proceedings of the 23rd Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1996, pp. 99–108. ACM, New York (1996)

    Chapter  Google Scholar 

  15. Hoppe, H., DeRose, T., Duchamp, T., McDonald, J., Stuetzle, W.: Surface reconstruction from unorganized points. SIGGRAPH Comput. Graph. 26(2), 71–78 (1992)

    Article  Google Scholar 

  16. Hoppe, H., DeRose, T., Duchamp, T., McDonald, J., Stuetzle, W.: Mesh optimization. In: Proceedings of the 20th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1993, pp. 19–26. ACM, New York (1993)

    Chapter  Google Scholar 

  17. Isenburg, M., Lindstrom, P., Gumhold, S., Snoeyink, J.: Large mesh simplification using processing sequences. In: Turk, G., van Wijk, J.J., Moorhead II, R.J. (eds.) IEEE Visualization, pp. 465–472. IEEE Computer Society (2003)

    Google Scholar 

  18. Johnson, A.E., Herbert, M.: Control of polygonal mesh resolution for 3-D computer vision. Graph. Models Image Process. 60(4), 261–285 (1998)

    Article  Google Scholar 

  19. Low, K.-L., Tang, T.-S.: Model simplification using vertex-clustering. In: Proc. of the 1997 Symposium on Interactive 3D Graphics, I3D 1997, pp. 75–81. ACM, New York (1997)

    Chapter  Google Scholar 

  20. Luebke, D., Watson, B., Cohen, J.D., Reddy, M., Varshney, A.: Level of Detail for 3D Graphics. Elsevier Science Inc., New York (2002)

    Google Scholar 

  21. Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Proc. of the 15th Annual ACM Symposium on Principles of Distributed Computing, PODC 1996, pp. 267–275. ACM, New York (1996)

    Chapter  Google Scholar 

  22. Georgia Institute of Technology. Large geometric models archive (February 2012), http://www.cc.gatech.edu/projects/large_models/

  23. Pan, Z., Zhou, K., Shi, J.: A new mesh simplification algorithm based on triangle collapses. J. Comput. Sci. Technol. 16(1), 57–63 (2001)

    Article  MATH  Google Scholar 

  24. Schroeder, W.J., Zarge, J.A., Lorensen, W.E.: Decimation of triangle meshes. SIGGRAPH Comput. Graph. 26(2), 65–70 (1992)

    Article  Google Scholar 

  25. Sinha, S.N., Frahm, J.-M., Pollefeys, M., Genc, Y.: GPU-based video feature tracking and matching. Technical report. Workshop on Edge Computing Using New Commodity Architectures (2006)

    Google Scholar 

  26. Stanford University. The Stanford 3D scanning repository (January 2012), http://graphics.stanford.edu/data/3Dscanrep/

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Suzanne M. Shontz .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shontz, S.M., Nistor, D.M. (2013). CPU-GPU Algorithms for Triangular Surface Mesh Simplification. In: Jiao, X., Weill, JC. (eds) Proceedings of the 21st International Meshing Roundtable. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33573-0_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33573-0_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33572-3

  • Online ISBN: 978-3-642-33573-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics