JBT Journal
Advanced

Raqamli Transformatsiya va Sun’iy Intellekt

COMPARATIVE ANALYSIS OF POLYGONAL MESH SIMPLIFICATION METHODS FOR REAL-TIME INTERACTIVE RENDERING

Saida Beknazarova1, Makhammadjon Makhammadjonov2

1 Tashkent University of Information Technologies named after Muhammad Al- Khwarizmi

2 Central Asian University

Zenodo DOI: 10.5281/zenodo.23319951

Keywords

polygonal mesh simplification quadric error metric level of detail geometric error real-time rendering topology simplification vertex clustering

Abstract

Polygonal mesh simplification is a core geometric operation of the real-time rendering pipeline, since the number of primitives submitted to the graphics processor in a single frame must be bounded in order to sustain an interactive frame rate. Several decades of research have produced method families that differ fundamentally in the geometric quantity they minimize and in the constraints they impose on the surface, yet a comparison of these families against a single set of criteria is largely absent from the literature. This paper presents a comparative analysis of four method families on the basis of representative studies: adaptive octree vertex clustering with an extended quadratic error matrix, iterative contraction driven by quadric error metrics, alpha-shape-based topology simplification, and voxel-based simplification employing morphological operators. A unified evaluation framework of seven criteria is proposed, comprising the class of error metric, the treatment of topology, the attainable reduction, computational cost and scalability, robustness to mesh degeneracies, preservation of surface attributes, and support for continuous level-of-detail transitions. The comparison is performed on the quantitative results reported in the source studies, reduced to a common form. It is shown that relaxing the topology constraint is the single largest lever on the attainable reduction, yielding improvement factors of up to 117.7 on mechanically structured models, whereas clustering methods retain a decisive advantage in execution time. It is further established that every error metric examined is purely object-space and observer-independent, which is formulated as the direction of further research.

Views: 152 Published: 2026-10-12 Pages: 97-107 Volume: 4 Issue: 5

References

  1. Cohen J., Varshney A., Manocha D., Turk G., Weber H., Agarwal P., Brooks F., Wright W. Simplification envelopes. Proceedings of SIGGRAPH '96. New Orleans, 1996, pp. 119–128.
  2. Edelsbrunner H., Mücke E.P. Three-dimensional alpha shapes. ACM Transactions on Graphics, 1994, vol. 13, no. 1, pp. 43–72.
  3. Turk G. Re-tiling polygonal surfaces. Computer Graphics, 1992, vol. 26, no. 2, pp. 55–64.
  4. Hoppe H. Progressive meshes. Proceedings of SIGGRAPH '96. New Orleans, 1996, pp. 99–108.
  5. Taubin G. A signal processing approach to fair surface design. Proceedings of SIGGRAPH '95. Los Angeles, 1995, pp. 351–358.
  6. Garland M., Heckbert P.S. Surface simplification using quadric error metrics. Proceedings of SIGGRAPH '97. Los Angeles, 1997, pp. 209–216.
  7. Lorensen W.E., Cline H.E. Marching cubes: a high resolution 3D surface construction algorithm. Computer Graphics, 1987, vol. 21, no. 4, pp. 163–169.
  8. Nooruddin F.S., Turk G. Simplification and repair of polygonal models using volumetric techniques. IEEE Transactions on Visualization and Computer Graphics, 2003, vol. 9, no. 2, pp. 191–205.
  9. Barequet G., Kumar S. Repairing CAD models. Proceedings of IEEE Visualization '97. Phoenix, 1997, pp. 363–370.
  10. Popović J., Hoppe H. Progressive simplicial complexes. Proceedings of SIGGRAPH '97. Los Angeles, 1997, pp. 217–224.
  11. Danielsson P.E. Euclidean distance mapping. Computer Graphics and Image Processing, 1980, vol. 14, no. 3, pp. 227–248.
  12. Luebke D., Erikson C. View-dependent simplification of arbitrary polygonal environments. Proceedings of SIGGRAPH '97. Los Angeles, 1997, pp. 198–208.
  13. Pajon J.L., Guilloteau P. Geometry simplification for interactive visualization of complex engineering data. Transactions on Information and Communications Technologies, 1995, vol. 12, pp. 51–57.
  14. Low K.-L., Tan T.-S. Model simplification using vertex clustering. Proceedings of the Symposium on Interactive 3D Graphics. Providence, 1997, pp. 75–81.
  15. Schroeder W.J., Zarge J.A., Lorensen W.E. Decimation of triangle meshes. Computer Graphics, 1992, vol. 26, no. 2, pp. 65–70.
  16. Funkhouser T.A., Séquin C.H. Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments. Proceedings of SIGGRAPH '93. Anaheim, 1993, pp. 247–254.
  17. Rossignac J., Borrel P. Multi-resolution 3D approximations for rendering complex scenes. Modeling in Computer Graphics. Berlin, Springer-Verlag, 1993, pp. 455–465.
  18. Garland M., Heckbert P.S. Simplifying surfaces with color and texture using quadric error metrics. Proceedings of IEEE Visualization '98. Research Triangle Park, 1998, pp. 263–269.
  19. Schroeder W.J. A topology modifying progressive decimation algorithm. Proceedings of IEEE Visualization '97. Phoenix, 1997, pp. 205–212.
  20. Zhou K., Zhang M., Shi J., Pan Z. A new simplification algorithm for colored or textured polygonal models. The International Journal of Virtual Reality, 2000, vol. 4, no. 4, pp. 1–20.
  21. El-Sana J., Varshney A. Topology simplification for polygonal virtual environments. IEEE Transactions on Visualization and Computer Graphics, 1998, vol. 4, no. 2, pp. 133–144.
  22. Hoppe H. View-dependent refinement of progressive meshes. Proceedings of SIGGRAPH '97. Los Angeles, 1997, pp. 189–197.