Skip to main content
SpringerLink
Log in

Generating high-quality discrete LOD meshes for 3D computer games in linear time

  • Regular Paper
  • Published:
Multimedia Systems Aims and scope Submit manuscript

Abstract

The real-time interactive 3D multimedia applications such as 3D computer games and virtual reality (VR) have become prominent multimedia applications in recent years. In these applications, both visual fidelity and degree of interactivity are usually crucial to the success or failure of employment. Although the visual fidelity can be increased using more polygons for representing an object, it takes a higher rendering cost and adversely affects the rendering efficiency. To balance between the visual quality and the rendering efficiency, a set of level-of-detail (LOD) meshes has to be generated in advance. In this paper, we propose a highly efficient polygonal mesh simplification algorithm that is capable of generating a set of high-quality discrete LOD meshes in linear run time. The new algorithm adopts memoryless vertex quadric computation, and suggests the use of constant size replacement selection min-heap, pipelined simplification, two-stage optimization, and a new hole-filling scheme, which enable it to generate very high-quality LOD meshes using relatively small amount of main memory space in linear runtime.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Watt, A.: 3D Computer Graphics, 3rd ed. Addison-Wesley, Reading, MA (2000)

    Google Scholar 

  2. Luebke, D. et al.: Level-of-Detail for 3D Graphics. Morgan Kaufman, San Francisco, CA (2003)

    Google Scholar 

  3. Lindstrom, P., Turk, G.: Evaluation of memoryless simplification. IEEE Trans. Vis. Comput. Graph. 5(2), 98–115 (1999)

    Article  Google Scholar 

  4. Knuth, D.E.: The Art of Computer Programming, vol. 3. Addison-Wesley, Reading, MA (1973)

    Google Scholar 

  5. Lindstrom, P.: Out-of-core simplification of large polygonal models. In: Proceedings of the SIGGRAPH '00, vol. 34, pp. 259–270 (2000)

  6. Wu, J., Kobbelt, L.: Fast mesh decimation by multiple-choice techniques. In: Proceedings of 7th International Fall Workshop on Vision, Modeling, and Visualization, pp. 241–248 (2002)

  7. Wu, J., Kobbelt, L.: A stream algorithm for the decimation of massive meshes. In: Proceedings of the Graphics Interface '03, pp. 185–192 (2003)

  8. Rossignac, J., Borrel, P.: Multi-resolution 3D approximation for rendering complex scenes. In: Proceedings of the Geometric Modeling in Computer Graphics '93, pp. 455–465 (1993)

  9. Low, K.L., Tan, T.S.: Model simplification using vertex clustering. In: Proceedings of the Symposium on Interactive 3D Graphics '97, pp. 75–82 (1997)

  10. Lindstrom, P., Silva, C.T.: A memory insensitive technique for large model simplification. In: Proceedings of the IEEE Visualization '01, vol. 35, pp. 121–126 (2001)

  11. Shaffer, E., Garland, M.: Efficient adaptive simplification of massive meshes. In: Proceedings of the IEEE Visualization '01, pp. 127–134 (2001)

  12. Schroeder, W.J., Zarge, J.A., Lorensen, W.E.: Decimation of triangle meshes. In: Proceedings of the SIGGRAPH '92, vol. 26, pp. 65–70 (1992)

  13. Hoppe, H. et al.: Mesh optimization. In: Proceedings of the SIGGRAPH '93, vol. 27, pp. 19–26 (1993)

  14. Hoppe, H.: Progressive meshes. In: Proceedings of the SIGGRAPH '96, vol. 30, pp. 99–108 (1996)

  15. Ronfard, R., Rossignac, J.: Full-range approximation of triangulated polyhedra. In: Proceedings of the Eurographics '96, vol. 15, no. 3, pp. 67–76 (1996)

  16. Garland, M., Heckbert, P.S.: Surface simplification using quadric error metrics. In: Proceedings of the SIGGRAPH '96, vol. 30, pp. 209–216 (1997)

  17. Kobbelt, L., Campagna, S., Seidel, H.P.: A general framework for mesh decimation. In: Proceedings of the Graphics Interface '98, pp. 43–50 (1998)

  18. Campagna, S., Kobbelt, L., Seidel, H.P.: Efficient decimation of complex meshes. Technical Report, Computer Graphics Group, University of Erlangen-Nürnberg, Germany (1998)

  19. Hoppe, H.: New quadric metric for simplifying meshes with appearance attributes. In: Proceedings of IEEE Visualization '99, pp. 59–66 (1999)

  20. Cignoni, P., Montani, C., Rocchini, C., Scopigno, R.: A general method for preserving attribute values on simplified meshes. In: Proceedings of IEEE Visualization '98, pp. 59–66 (1998)

  21. Cohen, J., Manocha, D., Olano, M.: Simplifying polygonal models using successive mappings. In: Proceedings of IEEE Visualization '97, pp. 395–402 (1997)

  22. Cohen, J., Olano, M., Manocha, D., Appearance preserving simplification. In: Proceedings of SIGGRAPH '98, pp. 115–122 (1998)

  23. Sander, P., Snyder, J., Gortler, S., Hoppe, H.: Texture mapping progressive meshes. In: Proceedings of SIGGRAPH '01, pp. 409–416 (2001)

  24. Garland, M., Zhou, Y.: Quadric-based simplification any dimension. ACM Trans. Graph. 24(2) (2005)

  25. Clark, J.H.: Hierarchical geometric models for visible surface algorithms. Commun. ACM 19(10), 547–554 (1976)

    Article  MATH  Google Scholar 

  26. Funkhouser, T.A.: Database and display algorithms for interactive visualization of architectural models. Ph.D. Dissertation, The University of California at Berkeley (1993)

  27. Giegl, M., Wimmer, M.: Unpopping: solving the image-space blend problem. available at www.cg.tuwien.ac.at/research/vr/ unpopping/unpopping.pdf, submitted to Journal of Graphics Tools, Special Issue on Hardware-Accelerated Rendering Techniques (2005)

  28. Xia, J.C., El-Sana, J., Varshney, A.: Adaptive real-time level-of-detail-based rendering for polygonal models. IEEE Trans. Vis. Comput. Graph. 3(2), 171–183 (1997)

    Article  Google Scholar 

  29. El-Sana, J., Chiang, Y.J.: External memory view-dependent simplification. Comput. Graph. Forum 19(3), 139–150 (2000)

    Article  Google Scholar 

  30. Luebke, D., Erikson, C.: View-dependent simplification of arbitrary polygonal environments. In: Proceedings of the SIGGRAPH '97, vol. 31, pp. 199–208 (1997)

  31. Cignoni, P. et al.: External memory management and simplification of huge meshes. IEEE Trans. Vis. Comput. Graph. 9(4), 525–537 (2003)

    Article  Google Scholar 

  32. Shafer, E., Garland, M.: A multiresolution representation for massive meshes. IEEE Trans. Vis. Comput. Graph. 11(2), 139–148 (2005)

    Article  PubMed  Google Scholar 

  33. Chen, H.K. et al.: A linear time algorithm for high-quality mesh simplification. In: Proceedings of the IEEE 6th International Symposium on Multimedia Software Engineering, pp. 169–176 (2004)

  34. Chen, H.K. et al.: A novel cache-based approach to large mesh simplification. J. Inf. Sci. Eng. (to appear)

  35. Levoy, M. et al.: The Digital Michelangelo Project: 3D scanning of large statues. In: Proceedings of the SIGGRAPH '00, pp. 131–144 (2000)

  36. Garland, M., Heckbert, P.S.: QSlim v.2.0 Simplification Software, Dept. of Computer Science, University of Illinois, http://graphics.cs.uiuc.edu/~garland/software/QSlim.html (1999)

  37. Cignoni, P., Rocchini, C., Scopigno, R.: Metro: measuring error on simplified surfaces. In: Proceedings of the Eurographics '98, vol. 17, no. 2, pp. 167–174 (1998)

  38. Houle, J., Poulin, P.: Simplification and real-time smooth transitions of articulated meshes. In: Proceedings of the Graphics Interface '01, pp. 55–60 (2001)

  39. Lin, C.H., Lee, T.Y.: Metamorphosis of 3D polyhedral models using progressive connectivity transformations. IEEE Trans. Vis. Comput. Graph. 11(1), 2–12 (2005)

    Article  PubMed  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronic Engineering National Taiwan, University of Science and Technology, Taipei, Taiwan, R.O.C.

    Hung-Kuang Chen & Ming-Bo Lin

  2. Department of Information and Design, Asia University, Taichung, Taiwan, R.O.C.

    Hung-Kuang Chen & Rong-Ming Chen

  3. Department of Computer Science and Information Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan, R.O.C.

    Chin-Shyurng Fahn

  4. Department of Computer Science, University of Illinois, at Chicago, U.S.A.

    Jeffrey J. P. Tsai

Authors
  1. Hung-Kuang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chin-Shyurng Fahn
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jeffrey J. P. Tsai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Rong-Ming Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ming-Bo Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hung-Kuang Chen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, HK., Fahn, CS., Tsai, J.J.P. et al. Generating high-quality discrete LOD meshes for 3D computer games in linear time. Multimedia Systems 11, 480–494 (2006). https://doi.org/10.1007/s00530-006-0017-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00530-006-0017-1

Keywords

Search

Navigation