| 二维Delaunay网格的一个约束边恢复算法 |
| |
| 引用本文： | 梁虎,唐玲艳,宋松和.二维Delaunay网格的一个约束边恢复算法[J].航空计算技术,2011,41(2):21-24. |
| |
| 作者姓名： | 梁虎 唐玲艳 宋松和 |
| |
| 作者单位： | 国防科技大学,理学院,湖南,长沙,410073 |
| |
| 基金项目： | 国家重点基础研究发展规划973项目资助，国家自然科学基金项目资助 |
| |
| 摘 要： | 针对二维约束Delaunay网格生成中约束边恢复问题,提出了一个基于平面扫描策略的约束边恢复算法,证明其收敛性。给出了算法的计算复杂度,说明了算法能有效减少＂相交测试＂的次数。实现算法并用复杂算例验证了所得结论。
|
| 关 键 词： | 网格生成 平面扫描 Delaunay 约束边恢复 |
An Edge Recovery Algorithm for 2D Delaunay Mesh |
| |
| LIANG Hu,TANG Ling-yan,SONG Song-he.An Edge Recovery Algorithm for 2D Delaunay Mesh[J].Aeronautical Computer Technique,2011,41(2):21-24. |
| |
| Authors: | LIANG Hu TANG Ling-yan SONG Song-he |
| |
| Institution: | (Science College,National University of Defense Technology,Changsha 410073,China) |
| |
| Abstract: | We present an edge recovery algorithm based on plane-sweeping scheme for 2D constrained Delaunay mesh generation and prove its correctness.We also give the asymptotic time complexity of the algorithm and prove that the algorithm will effiectively reduce the number of intersection test.At last,we demonstrate the performance of our algorithm though complicated example. |
| |
| Keywords: | mesh generation plane-sweeping Delaunay edge recovery |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
