基于融和算法的二维Delaunay三角网任意点定位研究  

Study on the random point position of two-dimensional Delaunay TIN based on a fusion algorithm

作　　者：张咏[1,2] 刘长星[1] 杨瑜华 董汉军[1] 

机构地区：[1]西安科技大学测绘科学与技术学院,西安710054 [2]中冶成工上海五冶建设有限公司,上海201900

出　　处：《测绘科学》2010年第2期85-87,84,共4页Science of Surveying and Mapping

摘　　要：二维Delaunay三角网中任意点定位的快慢是影响整个内插构网速度的关键因素。针对目前各种算法还不能在定位速度和穿越路径惟一性之间达到一个有效平衡,本文从计算机实现角度出发,将三角形面积坐标、重心和点与有向线段的关系三者有机结合,构建出一种新的点定位算法。算法定位路径惟一,速度快,是一种健壮高效的最短路径定位算法。The speed to position random point in two-dimensional Delaunay triangulation is key factor for construction of TIN. A perfect balance between the speed and the unique crossing route is difficult to obtain. The paper from the perspective of computers in- herited merit of previous algorithms and constructed a new point position algorithm. The algorithm was proved robust and efficient in shortest path position by creating a perfect balance in the position speed and unieity of the crossing path.

关 键 词：不规则三角网 点定位 正负划分性 高效 健壮 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]