2017/05/06 by Jeanne Pellerin, Pellerin, Jeanne, Amaury Johnen +5
Computer Science · Engineering · Environmental Science · #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #FOS: Computer and information sciences #Microplastics and Plastic Pollution #Modular Robots and Swarm Intelligence
paper · pdf · doi:10.48550/arxiv.1705.02451
openalex publication_date 2017/05/06 · openalex created_date 2022/10/05 · openalex updated_date 2026/07/28
Indirect hex-dominant meshing methods rely on the detection of adjacent\ntetrahedra an algorithm that performs this identification and builds the set of\nall possible combinations of tetrahedral elements of an input mesh T into\nhexahedra, prisms, or pyramids. All identified cells are valid for engineering\nanalysis. First, all combinations of eight/six/five vertices whose connectivity\nin T matches the connectivity of a hexahedron/prism/pyramid are computed. The\nsubset of tetrahedra of T triangulating each potential cell is then determined.\nQuality checks allow to early discard poor quality cells and to dramatically\nimprove the efficiency of the method. Each potential hexahedron/prism/pyramid\nis computed only once. Around 3 millions potential hexahedra are computed in 10\nseconds on a laptop. We finally demonstrate that the set of potential hexes\nbuilt by our algorithm is significantly larger than those built using\npredefined patterns of subdivision of a hexahedron in tetrahedral elements.\n