摘要
为进一步提高地图代数距离变换算法的效率,详细分析了已有地图代数的欧氏距离变换算法,针对三个方面对已有算法进行改进,并且运用C++语言编写程序实现。该算法在增加较小存储空间的情况下,避免了行列号的排序查找,与已有算法进行了对比试验,证实该算法的效率较已有算法提高了约20%。
To further enhance the efficiency of map algebra distance transform algorithm,the Euclidean distance transform algorithm of the existing map algebra was explicitly analyzed,and the existing algorithm was improved from three aspects;Also a program implementation was programmed with C ++language.Under the condition of increasing smaller storage space,this algorithm avoided the sorting and searching of rank numbers,and after a comparison test with existing algorithms,it was confirmed that the efficiency of this algorithm was improved by about 20% compared to the old one.
引文
[1]张晓贺,翟亮,张志华.欧氏距离变换光栅扫描算法的改进及扩展[J].兰州交通大学学报,2012,33(1):102-104.
[2]夏兰芳,胡鹏,白轶多,等.基于地图代数的最小生成树实现方法[J].测绘科学,2008,33(1):141-143.
[3]王满,孙海燕.基于地图代数的缓冲区分析算法的研究[J].测绘信息与工程,2009,34(3):33-34.
[4]胡鹏,游涟,吴艳兰,等.地图代数[M].武汉:武汉大学出版社,2006.
[5]吴艳兰,胡鹏,王乐辉.基于地图代数的山脊线和山谷线提取方法[J].测绘信息与工程,2006,31(2):15-16.
[6]耿协鹏,杨传勇,胡鹏.基于地图代数距离变换的空间实体分布的聚集度分析[J].测绘科学,2006,31(2):86-87.
[7]黄培之.提取山脊线和山谷线的一种新方法[J].武汉大学学报:信息科学版,2001,26(3):247-252.