Abstract
We propose a new strategy for the parallelization of mesh processing algorithms. Our main contribution is the definition of distributed combinatorial maps (called n-dmaps), which allow us to represent the topology of big meshes by splitting them into independent parts. Our mathematical definition ensures the global consistency of the meshes at their interfaces. Thus, an n-dmap can be used to represent a mesh, to traverse it, or to modify it by using different mesh processing algorithms. Moreover, an nD mesh with a huge number of elements can be considered, which is not possible with a sequential approach and a regular data structure. We illustrate the interest of our solution by presenting a parallel adaptive subdivision method of a 3D hexahedral mesh, implemented in a distributed version. We report space and time performance results that show the interest of our approach for parallel processing of huge meshes.
Subject
Computational Mathematics,Computational Theory and Mathematics,Numerical Analysis,Theoretical Computer Science
Reference49 articles.
1. Polygon Mesh Processing;Botsch,2010
2. A subdivision scheme for hexahedral meshes
3. Physically-Based Simulation of Cuts in Deformable Bodies: A Survey;Wu,2014
4. Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications;Sharir,1995
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Transparent Parallelization of Enrichment Operations in Geometric Modeling;Proceedings of the 15th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications;2020
2. Editorial: Special Issue on Efficient Data Structures;Algorithms;2019-07-05