Design and achievement of edgematching algorithm of line features in arbitrary scope
Design and achievement of edgematching algorithm of line features in arbitrary scope
复制标题
DOI：
--
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
Wang Peng
中科院分区：
文献类型：
--
作者：
Wang Peng
分析了传统边缘匹配算法的不足，提出了一种有效的任意范围边缘匹配算法。该算法通过对参与者特征类进行两次过滤，然后提取参与者特征类，有效地缩短了执行时间。然而，为了根据参与特征类的空间邻近关系进行边缘匹配，将边缘匹配特征与其直线的交点与边缘匹配直线第一点之间的距离作为关键值。然后根据键值对边缘匹配特征信息进行排序。这样，算法可以获得更快的匹配效率，并且可以处理匹配边在边缘匹配线节点之外的情况。最后，通过武汉市城市等高线的更新实验，验证了该算法的有效性和准确性。
After the deficiency of conventional edgematching algorithm was analyzed in this paper,an efficient edgematching algorithm in arbitrary scope was presented.Through filtering the participant feature classes twice,and then fetching the participant feature classes,this algorithm effectively shortened the executive time.However,in order to carry through edgematching according to the spatial vicinity relation of the participant feature classes,the distance between the intersection of edgematching features along with its line and the first point of edgematching line was taken as key value.Then by the key value,the information of edgematching feature could be sorted.In this way,the algorithm could get faster matching efficiency and deal with the condition that matching edges are outside the node of edgematching line.Finally,by the experimentation of updating the contour line of Wuhan city,the efficiency and accuracy of the algorithm were verified.