Improved boundary constrained tetrahedral mesh generation by shell transformation
Improved boundary constrained tetrahedral mesh generation by shell transformation
复制标题
DOI：
10.1016/j.apm.2017.07.011
复制
发表时间：
2017-11
影响因子：
5
通讯作者：
Jianjun Chen;Jianjing Zheng;Yao Zheng;H. Si;O. Hassan;K. Morgan
中科院分区：
文献类型：
--
作者：
Jianjun Chen;Jianjing Zheng;Yao Zheng;H. Si;O. Hassan;K. Morgan
在生成约束四面体网格的边界恢复过程中可能会插入过多的斯坦纳点，这些斯坦纳点在某些情况下是有害的。在本研究中，提出了一种新的翻转命名壳变换，以减少边界恢复中斯坦纳点的使用，从而提高边界恢复在鲁棒性、效率和单元质量方面的性能。壳变换在多个选择中搜索局部最优网格。同时，它的递归调用可以对比单次翻转大得多的元素集执行翻转，从而获得更好的局部最优解。通过正确使用壳变换，可以将与预定义约束密集相交的网格变换为交点少得多的另一种网格，从而显着减少斯坦纳点插入的机会。此外，壳变换可用于通过积极翻转网格来删除现有的斯坦纳点。提供了各种工业应用的网格划分示例和主要由拉伸三角形组成的表面输入，以说明改进的算法如何处理困难的边界约束网格划分任务。
An excessive number of Steiner points may be inserted during the process of boundary recovery for constrained tetrahedral mesh generation, and these Steiner points are harmful in some circumstances. In this study, a new flip namedshell transformationis proposed to reduce the usage of Steiner points in boundary recovery and thus to improve the performance of boundary recovery in terms of robustness, efficiency and element quality. Shell transformation searches for a local optimal mesh among multiple choices. Meanwhile, its recursive callings can perform flips on a much larger element set than a single flip, thereby leading the way to a better local optimum solution. By employing shell transformation properly, a mesh that intersects predefined constraints intensively can be transformed to another one with much fewer intersections, thus remarkably reducing the occasions of Steiner point insertion. Besides, shell transformation can be used to remove existing Steiner points by flipping the mesh aggressively. Meshing examples for various industrial applications and surface inputs mainly composed of stretched triangles are presented to illustrate how the improved algorithm works on difficult boundary constrained meshing tasks.