Line Grouping Matching Algorithm Based on Geometric Characteristics
Li Gan · Jisuanji kexue yu tansuo · 2015
To reduce the huge computation and low efficiency of the traditional line grouping matching(LGM) algorithm,this paper proposes a new LGM algorithm based on geometric characteristics.Firstly,the proposed algorithm defines two kinds of binary relations for the line segment pair,undirected binary relation and directed binary relation.Secondly,the coarse matching procedure calculates the undirected dissimilarities,and generates a candidate line segment group(LSG) set by using two thresholds.Thirdly,the precise matching procedure calculates the directed dissimilarity for every LSG.Finally,the matching results are generated by utilizing the two kinds of dissimilarities.Compared with the line feature matching technique based on eigenvectors and the line matching based on geometric characteristics?binary relations(GCBR),on the one hand,the coarse matching procedure with designing two thresholds has less time consuming than designing only one threshold,on the other hand,the precise matching procedure can filter out the unreasonable candidate LSGs and get the optimized results.The experimental results show that the proposed algorithm is feasible and efficient,moreover has better effect.