A New Data Structure For Handling Efficiently Polyhedral Complexes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2022

A New Data Structure For Handling Efficiently Polyhedral Complexes


This work is part of a PhD thesis about polyhedral mesh generation for simulation of geological phenomena. Two recent numerical methods enable us to use meshes containing polyhedra with any number of faces : on the one hand, we have non-linear finite volumes, for which orthogonality condition is no longer required, on the other hand, we can use the virtual elements method which generalizes FEMs and which does not have to consider simplicial meshes. Consequently, we need a reliable structure which is able to represent, to build, to travel and to modify polyhedral complexes having lots of generic polyhedra. Moreover, we want a compact and versatile structure to handle topology of potentially huge meshes, which help us write algorithms easily. First, after presenting how that structure caters to our needs, we will unveil its layout and some implementation details. Then, we will deal with space and time complexity. We will give several advantages and drawbacks of the structure, which will be highlighted by performance tests. We will compare our structure and other data structures for 3D meshes. Finally, we will show examples of meshes proving that the data structure is operational.
Not file

Dates and versions

hal-03650376 , version 1 (25-04-2022)


  • HAL Id : hal-03650376 , version 1


Alexandre Marin, Wassim Ahmed-Belkacem, Alexandra Bac, Laurent Astart. A New Data Structure For Handling Efficiently Polyhedral Complexes. RING Meeting, Jun 2022, Nancy, France. ⟨hal-03650376⟩
51 View
0 Download


Gmail Facebook Twitter LinkedIn More