A Comparative Study on Polygonal Mesh Simplification Algorithms

Creative Commons License

Yirci M., ULUSOY İ.

IEEE 17th Signal Processing and Communications Applications Conference, Antalya, Turkey, 9 - 11 April 2009, pp.85-88 identifier identifier

  • Publication Type: Conference Paper / Full Text
  • Doi Number: 10.1109/siu.2009.5136501
  • City: Antalya
  • Country: Turkey
  • Page Numbers: pp.85-88
  • Middle East Technical University Affiliated: No


Polygonal meshes are a common way of representing three dimensional surface models in many different areas of computer graphics and geometry processing. However, with the evolution of the technology, polygonal models are becoming more and more complex. As the complexity of the models increase, the visual approximation to the real world objects get better but there is a trade-off between the cost of processing these models and better visual approximation. In order to reduce this cost, the number of polygons in a model can be reduced by mesh simplification algorithms. These algorithms are widely used such that nearly all of the popular mesh editing libraries include at least one of them. In this work, polygonal simplification algorithms that are embedded in open source libraries: CGAL, VTK and OpenMesh are compared with the Metro geometric error measuring tool. By this way we try to supply a guidance for developers for publicly available mesh libraries in order to implement polygonal mesh simplification.