摘要
基于Delaunay三角化技术提出了一种快速可靠的全自动初始三角化新方法,给出了一种简单有效的边界约束施加方法,所给出的实例表明了所提出的初始三角化方法的性能.
A fully automatic initial mesh generating algorithm based on the Delaunay triangulation technique is presented. A simple but effective method for imposing the boundary constraint is given. Examples are provided to show the performance of the algorithm. As an important part of a geometrybased, fast, effective, automatic and adaptive mesh generating scheme proposed by the authors, the initial mesh generating algorithm requires only the characteristic venices of the objective boundary and the boundary line segments as the original input data. The algorithm is suitable for any complex planar domain.
出处
《华中理工大学学报》
CSCD
北大核心
1996年第5期19-22,共4页
Journal of Huazhong University of Science and Technology
关键词
全自动网格生成
初始三角化
有限元
fully automatic mesh generation
initial triangulation
Delaunay triangulation
finite element