期刊文献+

Delaunay三角网中点目标快速定位算法研究 被引量:28

Research on algorithms of point fast position in delaunay triangular net
下载PDF
导出
摘要 为了提高内插法的构网速度及方便数字地面模型的后续应用,本文对三角形定位算法进行了研究,对基于点-线关系的方向定位算法和基于线-线关系的方向定位算法进行了改进,算法极大地减少了定位目标三角形的时间,由于定位三角形的速度是影响内插构网速度的一个关键因素,从而提高了构网速度。同时对两种算法进行了分析比较,得出最速方向定位算法更健壮,其定位路径唯一,效率更高。 In order to improve the speed of constructing Delaunay triangulation network for interpolation and application of DTM,this paper researches on the point position algorithm in the network and improves two algorithms.The first is based on relation of inserting point and triangles'edges and the second is based on relations of the line of in-setting point and triangle vertex and the triangle edges.The algorithms reduce the time to locate goal triangle greatly.The speed of locating the triangle which contain given point is an important factor of the efficiency of constructing the network,thus affects the speed of the network construction.This paper analyses and compares the above algorithms and concludes that fastest oriented locating algorithm is robust and efficient because its locating direction is unique.
出处 《测绘科学》 CSCD 北大核心 2007年第2期69-70,113,共3页 Science of Surveying and Mapping
基金 湖北省高等学校优秀中青年团队计划项目资助(T200602) 江西省数字国土重点实验室开发研究基金资助(DLLJ200501) 长江大学发展基金资助(2005)
关键词 DELAUNAY DEM 定位 算法 Delaunay DEM position algorithm
  • 相关文献

参考文献7

二级参考文献39

  • 1毋河海.地图数据库系统[M].北京:测绘出版社,1991.. 被引量:35
  • 2Peparata FP 庄心谷(译).计算几何导论[M].北京:科学出版社,1990.. 被引量:1
  • 3[2]Lawson C L. Generation of a triangular grid with application to contour plotting[A]. In: Technical Memorandum [C],Institute of Technology, Jet Pollution Laboratory, California,1972:299. 被引量:1
  • 4[3]Lee D T and Schacher B J. Two algorithms for constructing a delaunay triangulation[J]. International Journal of Computer and Information Sciences, 1980,(9 ): 219-242. 被引量:1
  • 5[4]Dawyer R A.A fast divide-and-conquer algorithm for constructing Delaunay triangulations[J].Algorithmica, 1987, (2): 137-151. 被引量:1
  • 6[6]Macedonio G and Pareschi M T. An algorithm for the triangulation of arbitrarily distributed points: applications to volume estimate and terrain fitting[J]. Computers & Geosciences, 1991, 17: 859-874. 被引量:1
  • 7[7]Brassel K E and Reif D. Procedure to generate thissen polygons[J]. Geographical Analysis, 1979,11:289-303. 被引量:1
  • 8[8]Mc Cullagh M J and Ross C G T.Delaunay triangulation of a random data set for is arithmic mapping[J]. The Cartographic Journal,1980, 17:93-99. 被引量:1
  • 9[10]Mirante A and WeinGarten N. The radical sweep algorithm for constructing triangulated irregular networks[J]. IEEE. Computer Graphics and application, 1982:11-21. 被引量:1
  • 10[13]YI Xiao, HONG Yan. Text region extraction in a document image based on the delaunay tessellation[J]. Pattren Recgonition, 2003,36. 被引量:1

共引文献471

同被引文献197

引证文献28

二级引证文献199

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部