A boundary recovery algorithm for Delaunay tetrahedral meshing
A boundary recovery algorithm for Delaunay tetrahedral meshing
复制标题
Delaunay四面体网格划分的边界恢复算法
DOI：
--
复制
发表时间：
1996
期刊：
影响因子：
--
通讯作者：
K. Nakahashi
中科院分区：
文献类型：
--
作者：
D. Sharov;K. Nakahashi
讨论了一种由四面体组成的非结构网格的自动生成方法。采用Delaunay方法生成四面体网格。对边界约束问题给予了特别的关注。采用边界交换、四面体边交换和四面体直接剖分相结合的方法，实现了一种简单、稳健的边界约束算法。稍加修改即可将该方法应用于粘性网格的生成。网格算例验证了该方法的有效性。
A method for automatic generation of unstructured grids comprised of tetrahedra is discussed. Delaunay approach for tetrahedral grid generation is used. Particular attention is given to the boundary constraining problem. A simple and robust algorithm for the boundary constraining by successive use of boundary edge swapping, tetrahedral edge swapping and direct subdivision of tetrahedra is used. Small modifications allow to apply the method for viscous grid generation as well. Grid examples demonstrate efficiency of the method.