摘要
提出了一种快速Delaunay四面体网格生成的分治算法,将给定约束数据域边界进行Delaunay三角剖分,然后从边界三角形开始递归生成四面体网格.该算法在约束数据域内部生成Delaunay四面体,边界三角形都将成为内部四面体的面,不需要进行边界一致性检查,可避免四面体穿过边界和狭长四面体的产生,而且算法容易理解方便编程.
A fast dividing and conquering algorithm of mesh generation of Delaunay tetrahedra in constrained domain was presented. After the boundary of the given domain was divided into Delaunay triangles from a given sample point set, tetrahedral meshes was made by selecting a suit point from given point cloud to have Delaunay property. The surface triangles become a direct consequence of interior tetrahedron. The algorithm does not require any surface conforming checks to avoid penetrated surface boundaries and overlapped tetrahedrons.
出处
《华中科技大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2005年第5期67-69,共3页
Journal of Huazhong University of Science and Technology(Natural Science Edition)
基金
教育部跨世纪优秀人才基金资助项目(20003)
教育部青年骨干教师基金资助项目(200065)
河北省科技厅攻关资助项目(032135125).
