| 2D-Delaunay三角网格的数据结构与遍历 |
| |
| 引用本文： | 高晓沨. 2D-Delaunay三角网格的数据结构与遍历[J]. 天津理工大学学报, 2006, 22(2): 66-69 |
| |
| 作者姓名： | 高晓沨 |
| |
| 作者单位： | 清华大学数学系,北京,100080 |
| |
| 摘 要： | 1907年,G.Voronoi首先提出三角网格化问题.后来Delaunay在1932年首次提出了解决的方法.三角网格化主要有两种准则:一种在生成的三角形网格中,各三角形的最小内角和为最大;另一种是所有三角形的边长和最小.其中,Delaunay三角剖分是目前研究应用最广的一种剖分方法.目前,国际上关
|
| 关 键 词： | Delaunay三角网格 类结构 自动生成 广度优先遍历 |
| 文章编号： | 1673-095X（2006）02-0066-04 |
| 收稿时间： | 2005-09-21 |
| 修稿时间： | 2005-09-21 |
Data structure and traverse of 2D-Delaunay triangulation |
| |
| GAO Xiao-feng. Data structure and traverse of 2D-Delaunay triangulation[J]. Journal of Tianjin University of Technology, 2006, 22(2): 66-69 |
| |
| Authors: | GAO Xiao-feng |
| |
| Affiliation: | Department of Mathematics, Tsinghua University, Beijing 100080, China |
| |
| Abstract: | The article summarized the realization of 2D-Delaunay triangulation,the steps of creating Bowyer-Watson automatic mesh generator,and then constructed a kind of Class structure as well as functions of this algorithm(using V C++6.0),and discussed different methods to traverse the triangle mesh,using data examination as contrast.Finallg,the author got the conclusion that Width First Traversal method is more effective and convenient.Besides, we discussed the effect between the order of original point set and running time of the program. |
| |
| Keywords: | delaunay triangulation class structure automatic generation width first traversal |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
