期刊文献+

基于栅格数据的最短距离快速求解方法

Fast Algorithm for the Shortest Distance Based on Raster Data
下载PDF
导出
摘要 目前,学者们在点到目标物的最短路径方面研究的很多,但在点到目标物的最短距离方面研究的很少,基于栅格数据求解点到目标物的最短距离方面研究的就更少。基于栅格数据传统的全部点逐点计算比较求出最短距离的算法效率偏低,为找到高效的解决办法,快速地求出点到目标物的最短距离,本文利用Arc Engine和VS2010平台,对基于栅格数据求解点到目标物的最短距离问题,提出了独到的算法和实现方法。 At present scholars have studied a lot of algorithms in the shortest path of point to target, while only a few researches have been done in the area of the shortest distance of point to the target, and the researches of solving the shortest distance of point to target based on raster data are even less. The traditional algorithms to find out the shortest distance based on the raster data are mainly by means of each point calculation and comparison, which is low efficiency. In order to find out an effective solution, this paper, puts forward an original algorithm and implements the shortest distance for point to target based on raster data with ArcEngine and VS2010 platform.
出处 《地理信息世界》 2015年第5期43-47,共5页 Geomatics World
基金 国家自然科学基金项目(41401457) 河南省重大科技专项(121100111300 131100110400) 河南省教育厅人文社会科学研究项目(2013-QN-079) 河南省高等学校重点科研项目(15A170003)资助
关键词 最短距离 栅格数据 点到线 点到目标物 算法设计 the shortest distance raster data point to line point to target algorithm design
  • 相关文献

参考文献5

  • 1Jun Chen,Renliang Zhao,Zhilin Li.Voronoi-based k -order neighbour relations for spatial analysis[J]. ISPRS Journal of Photogrammetry and Remote Sensing . 2004 (1)
  • 2A. K. Jain,M. N. Murty,P. J. Flynn.Data clustering[J].ACM Computing Surveys (CSUR).1999(3)
  • 3Remco C Veltkamp.Shape matching: similarity measures and algorithms. Proceedings of International Conference on Shape Modeling and Applications . 2001
  • 4Arc GIS Resources. http://resources.arcgis.com/zh-cn/help/main/10.1/index.html#//000800000048000000 .
  • 5William Rucklidge.Efficient Visual Recognition Using the Hausdorff Distance. . 1996

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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