摘要
直线游走算法是用于有界区域上的不规则大规模网格上确定点定位的一种常用方法.该方法可用于计算几何和其他许多领域,包括用有限元方法求解偏微分方程.然而,直线游走算法不适用于一些退化的情形,如交点和顶点重合.在本文中,作为一种改进,我们提出了一种新的直线游走算法使它对四面体网格碰到退化情形时也能适用,并通过数值实验进行充分验证.
The straight walk algorithm is commonly-used in searching for a mesh cell containing a query point in a given large scale unstructured mesh of a bounded domain.It could be used in computational geometry and several other fields,including solving partial differential equations with the finite element method.However,this algorithm does not work in some degenerate cases,such as the intersection point coincides with the vertex.In this paper,as an improvement,a new straight walk algorithm is presented to make it work for degenerate(or singular)cases in a tetrahedral mesh,which is well verified in our numerical tests.
作者
李姣
黄芬
呙蓉
应金勇
Li Jiao;Huang Fen;Guo Rong;Ying Jinyong(School of Mathematics and Statistics,Changsha University of Science and Technology,Changsha,Hunan 410114,China;School of Mathematics and Statistics,Central South University,Changsha,Hunan 410083,China)
出处
《数学理论与应用》
2020年第3期54-64,共11页
Mathematical Theory and Applications
基金
the National Natural Science Foundation of China(Grant No.11701576 and 11501053)
the Natural Science Foundation of Hunan Province(Grant No.2019JJ50786)
Changsha University of Science and Technology(Grant No.JG2019YB16)
关键词
直线游走算法
四面体网格
退化情形
点定位
Straight walk algorithm
Tetrahedral mesh
Degenerate case
Point location
