几何特性的直线编组匹配算法-计算机科学与探索.PDFVIP

李 钢.几何特性的直线编组匹配算法[J].计算机科学与探索，2015 ，9（11）：1382-1390. ISSN 1673-9418 CODEN JKYTA8 E-mail: fcst@vip. 163.com Journal of Frontiers of Computer Science and Technology 1673-9418/2015/09(11)- 1382-09 Tel: +86-10 doi: 10.3778/j.issn. 1673-9418.1506039 几何特性的直线编组匹配算法 李 钢+ 宜春学院 数学与计算机科学学院, 江西 宜春 336000 Line Grouping Matching Algorithm Based on Geometric Characteristics LI Gang+ College of Mathematics and Computational Science, Yichun University, Yichun, Jiangxi 336000, China + Corresponding author: E-mail: 562672612@ LI Gang. Line grouping matching algorithm based on geometric characteristics. Journal of Frontiers of Com- puter Science and Technology, 2015, 9(11) ：1382-1390. Abstract: To reduce the huge computation and low efficiency of the traditional line grouping matching (LGM) algo- rithm, 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 dis- similarity 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 l