首页 | 本学科首页   官方微博 | 高级检索  
     检索      

Delaunay三角网生长法的一种改进方法
引用本文:吴佳奇,徐爱功.Delaunay三角网生长法的一种改进方法[J].测绘科学,2012,37(2):103-104,187.
作者姓名:吴佳奇  徐爱功
作者单位:辽宁工程技术大学测绘与地理科学学院,辽宁阜新,123000
基金项目:辽宁省高等学校优秀人才支持计划资助(LR201018)
摘    要:为了提高Delaunay三角网的构建速度,本文对三角网生长法进行了改进,提出了一种基于生长法的"弧带搜索排除"方法,通过一系列的圆弧将离散点区域划分成几个弧带,构网时,规定只可在当前弧带搜索第三点,该弧带离散点搜索完毕后进入下一弧带,如此循环。采用VC++6.0加以实现。测试表明,该方法能够加快构网速度,生成的三角形形状良好,具有一定的实际效用。

关 键 词:Delaunay三角网  弧带搜索  VC++.

An improve method of Delaunay triangulated net growth algorithm
WU Jia-qi , XU Ai-gong.An improve method of Delaunay triangulated net growth algorithm[J].Science of Surveying and Mapping,2012,37(2):103-104,187.
Authors:WU Jia-qi  XU Ai-gong
Institution:(College of Geomatics,Liaoning Technical University,Liaoning Fuxin 123000,China)
Abstract:In order to increase the speed of constructing Delaunay triangulated net,the paper introduced an algorithm of Search and Elimination with Arc base on Triangular Growth algorithm.The area of point wass divided into several arc zones by several arcs.After searching the third point only at the current arc zone at the time of constructing net,it went into the next arc zone when all the points were searched,and then repeated the cycle.VC++6.0 was used to realize it.Test results showed that the method could increase the speed of constructing net.Triangular shape was good and the method would be useful in application.
Keywords:Delaunay triangulated net  searching by arc  VC++6  0
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号