$n$维非结构简单网格局部加密的共形标记二分法
Conformal marked bisection for local refinement of $n$-dimensional unstructured simplicial meshes
摘要:
提出了一种适用于非结构共形网格的$n$维标记二分法。我们设计的自适应$n$维应用程序的局部细化的方法。为此,我们提出了一个网格标记的预处理和三个标记二分法阶段。预处理将一致地标记初始网格。然后,在第一个$n-1$二分中,该方法以相反的顺序累积新顶点的列表。在第二阶段,即第$n$次对分阶段,该方法使用倒排表将对分后的单形转换为反射单形,反射单形是一种适合于最新顶点对分的单形类型。在最后阶段,在第$n$个二分之后,该方法切换到最新的顶点二分。为了允许这种切换,在第二阶段之后,我们检查在均匀平分下网格单形是共形的并且是反射的。这些条件足以使用最新的顶点二分法,二分法保证局部细化的关键优势。最后,结果表明,所提出的二分法是非常适合的局部加密的非结构共形网格。
英文摘要:
We present an $n$-dimensional marked bisection method for unstructured conformal meshes. We devise the method for local refinement in adaptive $n$-dimensional applications. To this end, we propose a mesh marking pre-process and three marked bisection stages. The pre-process marks the initial mesh conformingly. Then, in the first $n-1$ bisections, the method accumulates in reverse order a list of new vertices. In the second stage, the $n$-th bisection, the method uses the reversed list to cast the bisected simplices as reflected simplices, a simplex type suitable for newest vertex bisection. In the final stage, beyond the $n$-th bisection, the method switches to newest vertex bisection. To allow this switch, after the second stage, we check that under uniform bisection the mesh simplices are conformal and reflected. These conditions are sufficient to use newest vertex bisection, a bisection scheme guaranteeing key advantages for local refinement. Finally, the results show that the proposed bisection is well-suited for local refinement of unstructured conformal meshes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。