Advertisement

Fast Algorithm for Triangular Mesh Simplification Based on Vertex Decimation

  • Martin Franc
  • Vaclav Skala
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2330)

Abstract

A common task in computer graphics is the visualisation of models of real world objects. These models are very large and complex and their surfaces are usually represented by triangular meshes. The surface of complex model can contain thousands or even million of triangles. Because we want fast and interactive manipulation with these models, we need either to improve our graphics hardware or to find a method how to reduce the number of triangles in the mesh, e.g. mesh simplification. In this paper we will present a fast algorithm for triangular mesh reduction based on the principle of vertex decimation.

References

  1. 1.
    W. Schroeder, J. Zarge, W. Lorensen. Decimation of Triangle Meshes. In SIGGRAPH 92 Conference Proceedings, pages 65–70, July 1992.Google Scholar
  2. 2.
    H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, W. Stuetzle. Mesh optimization. In SIGGRAPH 93 Conference Proceedings, pages 19–26, 1993.Google Scholar
  3. 3.
    M. Garland, P. Heckbert. Surface Simplification Using Quadric Error Metrics. In SIGGRAPH 97 Conference Proceedings, 1997.Google Scholar
  4. 4.
    M. Garland. Multiresolution Modeling: Survey & Future Opportunities. In the SIGGRAPH 97 course notes, 1997.Google Scholar
  5. 5.
    D. Kirkpatrick. Optimal Search in Planar Subdivisions. SIAM J. Comp., pages 12:28–35, 1993.CrossRefMathSciNetGoogle Scholar
  6. 6.
    B. Junger, J. Snoeyink. Selecting Independent Vertices for Terrain Simplification. In WSCG 98 Proceedings, Pilsen University of West Bohemia, pages 157–164, February 1998.Google Scholar
  7. 7.
    M. Franc, V. Skala. Triangular Mesh Decimation in Parallel Environment. In 3rd Eurographics Workshop on Parallel Graphics & Visualization Conference Proceedings, Universitad de Girona, September 2000.Google Scholar
  8. 8.
    W. Lorensen, H. Cline. Marching Cubes: A High Resolution 3D Surface Construction Algorithm. Computer Graphics (SIGGRAPH 87 Proceedings), 21(4): 163–169, July 1987.Google Scholar
  9. 9.
    R. Klein, G. Liebich, W. Straser. Mesh reduction with error control. Proceedings of Visualization’ 96, 1996.Google Scholar
  10. 10.
    A. Ciampalini, P. Cignoni, C. Montani, R. Scopigno. Multiresolution decimation based on global error. Technical Report CNUCE: C96021, Istituto per l’Elaborazione dell’Informazione-Condsiglio Nazionale delle Richere, Pisa, ITALY, July 1996.Google Scholar
  11. 11.
    P. Lindstrom, G. Turk. Fast and memory efficient polygonal simplification. IEEE Visualization 98 Conference Proceedings, 1998.Google Scholar
  12. 12.
    A.W.F. Lee, W. Sweldens, P. Schroder, L. Cowsar. MAPS: Multiresolution Adaptive Parameterization of Surfaces. In SIGGRAPH’ 98 Proceedings. 1998.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Martin Franc
    • 1
  • Vaclav Skala
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of West BohemiaPilsenCzech Republic

Personalised recommendations