A recursive approach to local mesh refinement in two and three dimensions
A recursive approach to local mesh refinement in two and three dimensions
复制标题
DOI：
10.1016/0377-0427(94)90034-5
复制
发表时间：
1994-11
影响因子：
2.4
通讯作者：
Igor Kossaczký
中科院分区：
文献类型：
--
作者：
Igor Kossaczký
回顾和讨论了二维局部加细的最新顶点策略。提出了一种基于相似对分策略的三维四面体网格局部加密递归算法。递归方法需要对初始网格进行某些限制。另一方面，在这种条件下，细化过程可以根据需要保持局部，并且可以完全反演。简单的数据结构和反细化算法也概述。
The newest vertex strategy for local refinement in two dimensions is reviewed and discussed. A recursive algorithm for local refinement of tetrahedral meshes in three dimensions based on similar bisection strategy is described. The recursive approach requires certain restrictions on the initial mesh. On the other hand, under this condition, the refinement process can be kept as local as needed, and it can be fully inverted. Simple data structures and derefinement algorithms are also outlined.