Advertisement

Efficient Implementation of Multiresolution Triangle Strips

  • Óscar Belmonte
  • Inmaculada Remolar
  • José Ribelles
  • Miguel Chover
  • Marcos Fernández
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2330)

Abstract

Triangle meshes are currently the most popular standard model to represent polygonal surfaces. Drawing these meshes as a set of independent triangles involves sending a vast amount of information to the graphic engine. It has been shown that using drawing primitives, such as triangle fans or strips, dramatically reduces the amount of information. Multiresolution Triangle Strips (MTS) uses the connectivity information to represent a mesh as a set of multiresolution triangles strips. These strips are the basis of both the storage and rendering stages. They allow the efficient management of a wide range of levels of detail. In this paper, we have taken advantage of the coherence property between two levels of detail to decrease the visualisation time. MTS has been compared against Progressive Meshes and Multiresolution Ordered Meshes with Fans, the only model that uses the triangle fan as an alternative to the triangle primitive. In all cases, Multiresolution Triangle Strips obtains a better frame rate.

Keywords

Triangle Mesh Connectivity Information Adjacency List Polygonal Surface Progressive Mesh 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Arkin E.M., Helod, M., Mitchell J. B. S., Skiena, S. S.: Hamiltonian Triangulation for Fast Rendering, Visual Computer 12(9), 429–444, 1996.Google Scholar
  2. 2.
    Brassard, G., Bratley P.: Fundamentals of Algorithmics, Prentice Hall, 1996.Google Scholar
  3. 3.
    El-Sana, J. Evans, F., Varshney, A., Skiena S., Azanli, E.: Efficiently Computing and Updating Triangle Strips for Real-Time Rendering. The Journal Computer-Aided Design, Vol(32), IS(13), 753–772.Google Scholar
  4. 4.
    Garland, M., Heckbert P.: Surface Simplification Using Quadratic Error Metrics. Proc. of SIGGRAPH’97 (1997) 209–216Google Scholar
  5. 5.
    Garland, M., Heckbert, P.: Survey of polygonal surface simplification algorithms, Multiresolution Surface Modeling Course Notes of SIGGRAPH’97, 1997.Google Scholar
  6. 6.
    Garland, M.: Multiresolution Modeling: Survey & Future Opportunities. State of the Art Reports of EUROGRAPHICS’ 99 (1999) 111–131Google Scholar
  7. 7.
    Hoppe, H.: Progressive Meshes, Proceedings of SIGGRAPH’ 96, 99–108, 1996.Google Scholar
  8. 8.
    Hoppe, H.: View-Dependent Refinement of Progresive Meshes. Proc. of SIGGRAPH’97 (1997) 189–198Google Scholar
  9. 9.
    Puppo, E., Scopigno, R.: Simplification, LOD and Multiresolution-Principles and Applications, Tutorial Notes of EUROGRAPHICS’99, 1999.Google Scholar
  10. 10.
    Ribelles, J., López, A., Remolar, I., Belmonte, Ó., Chover M.: Multiresolution Modelling of Polygonal Surface Meshes Using Triangle Fans, Proceedings of 9th Discrete Geometry for Computer Imagery Conference, 431–442, 2000.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Óscar Belmonte
    • 1
  • Inmaculada Remolar
    • 1
  • José Ribelles
    • 1
  • Miguel Chover
    • 1
  • Marcos Fernández
    • 2
  1. 1.Departamento de Lenguajes y Sistemas InformáticosUniversitat Jaume ICastellónSpain
  2. 2.Departamento de InformáticaUniversitat de ValènciaValènciaSpain

Personalised recommendations