Fast and robust parallel simplification algorithm for triangular mesh

Zhenqi Yan; Li Yang; Song Wang

doi:10.1117/12.3008179

14 November 2023 Fast and robust parallel simplification algorithm for triangular mesh

Zhenqi Yan, Li Yang, Song Wang

Proceedings Volume 12934, Third International Conference on Computer Graphics, Image, and Virtualization (ICCGIV 2023); 129341S (2023) https://doi.org/10.1117/12.3008179
Event: 2023 3rd International Conference on Computer Graphics, Image and Virtualization (ICCGIV 2023), 2023, Nanjing, China

Abstract

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.

(2023) Published by SPIE. Downloading of the abstract is permitted for personal use only.

Citation Download Citation

Zhenqi Yan, Li Yang, and Song Wang "Fast and robust parallel simplification algorithm for triangular mesh", Proc. SPIE 12934, Third International Conference on Computer Graphics, Image, and Virtualization (ICCGIV 2023), 129341S (14 November 2023); https://doi.org/10.1117/12.3008179

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available