Fast and robust parallel simplification algorithm for triangular mesh

• Main Authors: Yan, Zhenqi, Yang, Li, Wang, Song
• Format: Conference Proceeding
• Language: English
• Published: SPIE 14.11.2023
• ISBN: 1510671722; 9781510671720
• ISSN: 0277-786X
• DOI: 10.1117/12.3008179

Mesh simplification is a fundamental problem in geometry processing. Since general simplification algorithms are difficult to parallelize, the main challenge is to process meshes of tens of millions of faces with fast and low memory consumption and maintain high-quality output. In this paper, we propose a multi-threaded algorithmic framework for mesh simplification. First, we design a robust and fast serial simplification model based on edge collapsing with low memory consumption. We implement a simplified algorithm based on Probabilistic QEM, and we take strict measures to protect the mesh topology as well as a greedy strategy to speed up the algorithm. Then we design a parallel simplification algorithm framework based on the idea of divide-and-conquer followed by global optimization. This method can execute the algorithm much faster with the same memory consumption as the serial method and maintain high-quality output results. Experiments show that our parallel algorithm outperforms current open-source software in terms of speed and memory consumption, and maintains good output for all models tested.