Distributed combinatorial maps
Résumé
This software implements the distributed combinatorial maps [1], a distributed data-structure allowing to build, store and modify a topological representation of a 3D mesh.
It is based on combinatorial maps [2] which allows to describe the topology of meshes subdivided in cells (vertices, edges, faces and volumes), and the additional geometrical layer called Linear cell complex [3].
To illustrate the interests of distributed combinatorial maps, this software implements a method to generate an hierarchical hexahedral mesh that approximate a given surface. This method takes a maximal subdivision level as parameter, and recursively subdivided all hexahedron that intersects the surface until having reached this maximal level.
3 versions of the software exist:
[2] Combinatorial Maps; Damiand G.; in CGAL User and Reference Manual, September 2011; https://www.cgal.org/Pkg/CombinatorialMaps
[3] Linear Cell Complexes; Damiand G.; in CGAL User and Reference Manual, March 2012; https://www.cgal.org/Pkg/LinearCellComplex
[4] Generic volume transfer for distributed mesh dynamic repartitioning; Damiand G., Jaillet F., Vidal V.; Engineering with Computers (EwC), June 2024; https://doi.org/10.1007/s00366-024-02008-9
To illustrate the interests of distributed combinatorial maps, this software implements a method to generate an hierarchical hexahedral mesh that approximate a given surface. This method takes a maximal subdivision level as parameter, and recursively subdivided all hexahedron that intersects the surface until having reached this maximal level.
3 versions of the software exist:
- sequential, one computer;
- parallel, multi-thread, one computer;
- parallel, mpi, several computers.
- enforce at most one level of subdivision of difference for two adjacent hexahedra;
- use transition patterns, to remove all the T-junctions. With this option, generate a mixed mesh, with hexahedra, tetrahedra, prisms and pyramids;
- project points on the surface, and remove degenerated elements;
- use cell transfer during the subdivision (method described in [4]) to accelerate the computation time of parallel versions.
[2] Combinatorial Maps; Damiand G.; in CGAL User and Reference Manual, September 2011; https://www.cgal.org/Pkg/CombinatorialMaps
[3] Linear Cell Complexes; Damiand G.; in CGAL User and Reference Manual, March 2012; https://www.cgal.org/Pkg/LinearCellComplex
[4] Generic volume transfer for distributed mesh dynamic repartitioning; Damiand G., Jaillet F., Vidal V.; Engineering with Computers (EwC), June 2024; https://doi.org/10.1007/s00366-024-02008-9
Domaines
Informatique [cs]![]()
Cite hal-04627721 Article Guillaume Damiand, Fabrice Jaillet, Vincent Vidal. Generic volume transfer for distributed mesh dynamic repartitioning. Engineering with Computers, 2024, ⟨10.1007/s00366-024-02008-9⟩. ⟨hal-04627721⟩
![]()
Cite hal-01844433 Article Guillaume Damiand, Aldo Gonzalez-Lorenzo, Florence Zara, Florent Dupont. Distributed Combinatorial Maps for Parallel Mesh Processing. Algorithms, 2018, 11 (7), pp.1-20. ⟨10.3390/a11070105⟩. ⟨hal-01844433⟩