arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1705.02451cs.CG
收藏

基于顶点的四面体组合六面体识别策略

Identifying combinations of tetrahedra into hexahedra: a vertex based strategy

Jeanne Pellerin, Amaury Johnen, Kilian Verhetsel, Jean-Francois Remacle

摘要:

间接六边形主导网格化方法依赖于相邻四面体的检测,该算法执行该识别并将输入网格T的四面体元素的所有可能组合的集合构建成六面体、棱柱或棱锥。所有识别的单元格对于工程分析是有效的。首先,计算其在T中的连通性与六面体/棱柱/棱锥的连通性相匹配的八个/六个/五个顶点的所有组合。然后确定T的四面体的子集,该子集三角形化每个潜在单元。质量检查允许早期丢弃质量差的细胞并显著提高方法的效率。每个潜在的六面体/棱柱/棱锥只计算一次。在一台笔记本电脑上,10秒内计算出大约300万个潜在的六面体。最后,我们证明了我们的算法建立的潜在的六边形的集合是显着大于那些建立使用预定义的模式的细分六面体四面体元素。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑