%0 Generic %1 pellerin2017identifying %A Pellerin, Jeanne %A Johnen, Amaury %A Verhetsel, Kilian %A Remacle, Jean-Francois %D 2017 %K 2017 arxiv computational-geometry geometry mesh polygon %T Identifying combinations of tetrahedra into hexahedra: a vertex based strategy %U http://arxiv.org/abs/1705.02451 %X Indirect hex-dominant meshing methods rely on the detection of adjacent tetrahedra an algorithm that performs this identification and builds the set of all possible combinations of tetrahedral elements of an input mesh T into hexahedra, prisms, or pyramids. All identified cells are valid for engineering analysis. First, all combinations of eight/six/five vertices whose connectivity in T matches the connectivity of a hexahedron/prism/pyramid are computed. The subset of tetrahedra of T triangulating each potential cell is then determined. Quality checks allow to early discard poor quality cells and to dramatically improve the efficiency of the method. Each potential hexahedron/prism/pyramid is computed only once. Around 3 millions potential hexahedra are computed in 10 seconds on a laptop. We finally demonstrate that the set of potential hexes built by our algorithm is significantly larger than those built using predefined patterns of subdivision of a hexahedron in tetrahedral elements.

@misc{pellerin2017identifying, abstract = {Indirect hex-dominant meshing methods rely on the detection of adjacent tetrahedra an algorithm that performs this identification and builds the set of all possible combinations of tetrahedral elements of an input mesh T into hexahedra, prisms, or pyramids. All identified cells are valid for engineering analysis. First, all combinations of eight/six/five vertices whose connectivity in T matches the connectivity of a hexahedron/prism/pyramid are computed. The subset of tetrahedra of T triangulating each potential cell is then determined. Quality checks allow to early discard poor quality cells and to dramatically improve the efficiency of the method. Each potential hexahedron/prism/pyramid is computed only once. Around 3 millions potential hexahedra are computed in 10 seconds on a laptop. We finally demonstrate that the set of potential hexes built by our algorithm is significantly larger than those built using predefined patterns of subdivision of a hexahedron in tetrahedral elements.}, added-at = {2020-07-11T20:53:56.000+0200}, author = {Pellerin, Jeanne and Johnen, Amaury and Verhetsel, Kilian and Remacle, Jean-Francois}, biburl = {https://www.bibsonomy.org/bibtex/23800cd323361defaa1b20dd65f8df96e/analyst}, description = {[1705.02451] Identifying combinations of tetrahedra into hexahedra: a vertex based strategy}, interhash = {5c17ed689e7324f9f69dc02a9732c845}, intrahash = {3800cd323361defaa1b20dd65f8df96e}, keywords = {2017 arxiv computational-geometry geometry mesh polygon}, note = {cite arxiv:1705.02451Comment: Preprint submitted to CAD (26th IMR special issue)}, timestamp = {2020-07-11T20:53:56.000+0200}, title = {Identifying combinations of tetrahedra into hexahedra: a vertex based strategy}, url = {http://arxiv.org/abs/1705.02451}, year = 2017 }