[1]王华军.三角网自动连接的聚焦算法[J].华侨大学学报(自然科学版),2005,26(2):199-202.[doi:10.3969/j.issn.1000-5013.2005.02.023]
　Wang Huajun.A Focus Algorithms for Auto-Connected Delaunay Triangular Mesh[J].Journal of Huaqiao University(Natural Science),2005,26(2):199-202.[doi:10.3969/j.issn.1000-5013.2005.02.023]
点击复制

三角网自动连接的聚焦算法()
分享到：

《华侨大学学报（自然科学版）》[ISSN:1000-5013/CN:35-1079/N]

卷:
第26卷
期数:
2005年第2期
页码:
199-202
栏目:
出版日期:
2005-04-20

文章信息/Info

Title:
A Focus Algorithms for Auto-Connected Delaunay Triangular Mesh
文章编号:
1000-5013(2005)02-0199-04
作者:
王华军
华侨大学信息科学与工程学院 福建泉州362021
Author(s):
Wang Huajun
College of Information Science and Engineering, Huaqiao University, 362021, Quanzhou, China
关键词:
Delaunay;  三角剖分;  等值线;  计算几何
Keywords:
delaunay;  triangulation;  contour;  computational geometry
分类号:
TP391.41
DOI:
10.3969/j.issn.1000-5013.2005.02.023
文献标志码:
A
摘要:
在三角网生长法的基础上,采用面向对象的技术,利用点数组和点索引数组来存贮平面上的散乱数据点.基于Delaunay三角剖分的“圆准则”,提出三角网自动连接的聚焦算法.该算法在扩展新三角形时,将点的搜索范围控制在已知三角形的外接圆内,计算速度大大加快.从给出的算例表明,该算法十分有效,特别适合于大数据量的三角剖分.
Abstract:
Algorithms for the automatic generation of Delaunay triangular mesh can basically be classified as: divide and conquer, point-by-point insertion, growth of triangular mesh. Based on the third one, the author proposes a focus algorithm for the automatic connection of Delaunay triangular mesh. The proposed algorithm is also based on circle criterion of Delauney triangulation. Moreover, it is proposed by adopting object-oriented technology and by using dot array and dot index array to store the 2D scattered and disordered data. During expanding new triangle, the proposed algorithm let the searching range of dot be controlled within the circumcircle of given triangle so as to accelerate the computation. The proposed algorithm is very efficicent and is suitable for triangulation of large amount of data in particalar as indicated by the given examples of computation.

参考文献/References:

[1] Schumaker L L. Triangulations in CAGD [J]. IEEE Computer Graphics and Applications, 1993(1):47-52.doi:10.1109/38.180117.
[2] 周晓云, 朱心雄. 散乱数据点三角剖分方法综述 [J]. 工程图学学报, 1993(1):48-54.
[3] Tsai V J D. Delaunay triangulations in TIN creation: An overview and a linear time algorithm [J]. International Journal of Geographical Information Science, 1993(6):501-524.doi:10.1080/02693799308901979.
[4] 潘国荣, 王穗辉. 微机图形学及其应用 [M]. 上海:同济大学出版社, 1997.115-120.
[5] 王莉, 李宗保, 吴志明. 计算机图形学及其在工程中的应用 [M]. 北京:人民交通出版社, 1992.240-241.
[6] 凌海滨, 吴兵. 改进的自连接Delaunay三角网生成算法 [J]. 计算机应用, 1999, (12):10-12.
[7] 毛善君, 季景贤. 寻找三角形扩展点的一种有效算法 [J]. 中国矿业大学学报, 1995(4):76-79.
[8] 洪家荣, 丁明峰. 三角剖分的模拟退火算法 [J]. 计算机学报, 1994(9):682-689.

备注/Memo

备注/Memo:
福建省青年科技人才创新基金资助项目(2001J007)
更新日期/Last Update: 2014-03-23