Distributed Combinatorial Maps for Parallel Mesh Processing
AbstractWe 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. View Full-Text
Share & Cite This Article
Damiand, G.; Gonzalez-Lorenzo, A.; Zara, F.; Dupont, F. Distributed Combinatorial Maps for Parallel Mesh Processing. Algorithms 2018, 11, 105.
Damiand G, Gonzalez-Lorenzo A, Zara F, Dupont F. Distributed Combinatorial Maps for Parallel Mesh Processing. Algorithms. 2018; 11(7):105.Chicago/Turabian Style
Damiand, Guillaume; Gonzalez-Lorenzo, Aldo; Zara, Florence; Dupont, Florent. 2018. "Distributed Combinatorial Maps for Parallel Mesh Processing." Algorithms 11, no. 7: 105.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.