割线中点距离的面要素匹配算法  

A matching algorithm based on the midpoint of the distance secant areal feature

作　　者：胡强强[1] 张宁宁[1] 高保禄[1] 徐成武[1] 李海芳[1] HU Qiangqiang Z HANG Ningning GAO Baolu XU Chengwu L I Hai fang(Taiyuan Universi- ty of Technology, Taiyuan 030024, Chin)

机构地区：[1]太原理工大学,太原030024

出　　处：《测绘科学》2017年第8期91-95,共5页Science of Surveying and Mapping

基　　金：山西省科技攻关计划项目(农业)(20130311037-4)

摘　　要：针对面要素图幅接边中出现的由于端点距离计算量大导致程序效率低的问题,该文提出了一种基于割线中点距离匹配的边界匹配方法。该算法通过获取面要素与边界线重叠的各线段的中点,对各中点进行距离匹配,从而完成面要素各段割线的匹配与割线端点的匹配。通过对割线中点的匹配,减少面要素匹配中需要匹配的点,达到节省时间的目的。通过面要素匹配实验证明:该算法可以在确保匹配准确性的情况下有效缩短面要素边界匹配的时间。Aiming at the problem that large amount of point distance calculation in area feature edge matching leading to the low rating,a matching algorithm of polygon feature based on the midpoint of distance secant was proposed.Through obtaining the midpoint on the overlapping segment of area feature and boundary line and the distance match of each midpoint,the matching of area feature secant and matching of end point on the segment were realized;the calculating time was condensed due to the decrease of the number of matching points by matching the secant midpoint.The area feature matching experiment results proved that this algorithm could effectively reduce the areal feature matching time and ensure the accuracy of matching.

关 键 词：面要素 割线中点 实体匹配 图幅接边 

分 类 号：P208[天文地球—地图制图学与地理信息工程]