| 约束数据域Delaunay四面体网格生成算法 |
| |
| 引用本文： | 关文革,武强,贾丽萍,刘明海. 约束数据域Delaunay四面体网格生成算法[J]. 华中科技大学学报(自然科学版), 2005, 33(5): 67-69 |
| |
| 作者姓名： | 关文革 武强 贾丽萍 刘明海 |
| |
| 作者单位： | 中国矿业大学,资源与安全学院,北京,100083;石家庄经济学院,河北,石家庄,050031;中国矿业大学,资源与安全学院,北京,100083;石家庄经济学院,河北,石家庄,050031 |
| |
| 基金项目： | 教育部跨世纪优秀人才基金资助项目(20003)，教育部青年骨干教师基金资助项目(200065)，河北省科技厅攻关资助项目(032135125). |
| |
| 摘 要： | 提出了一种快速Delaunay四面体网格生成的分治算法，将给定约束数据域边界进行Delaunay三角剖分，然后从边界三角形开始递归生成四面体网格．该算法在约束数据域内部生成Delaunay四面体，边界三角形都将成为内部四面体的面，不需要进行边界一致性检查，可避免四面体穿过边界和狭长四面体的产生，而且算法容易理解方便编程．
|
| 关 键 词： | 约束数据域 Delaunay四面体 网格生成 边界一致 |
| 文章编号： | 1671-4512(2005)05-0067-03 |
| 修稿时间： | 2004-07-13 |
Algorithm of mesh generation of Delaunay tetrahedral in constrained domain |
| |
| Guan Wen′ge,Wu Qiang,Jia Liping,LIU Minghai. Algorithm of mesh generation of Delaunay tetrahedral in constrained domain[J]. JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE, 2005, 33(5): 67-69 |
| |
| Authors: | Guan Wen′ge Wu Qiang Jia Liping LIU Minghai |
| |
| Abstract: | 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. |
| |
| Keywords: | constrained domain Delaunay tetrahedron mesh generation boundary conformance |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
