一种复杂矢量面状实体的匹配方法  

A matching method of complex vector polygon elements

作　　者：张家新[1] 韩保民[1] 逯跃锋[1] 颜怀成[1] 

机构地区：[1]山东理工大学建筑工程学院,山东淄博255049

出　　处：《山东理工大学学报（自然科学版）》2017年第5期65-69,共5页Journal of Shandong University of Technology:Natural Science Edition

摘　　要：针对复杂面状实体要素匹配问题,采用一种公共边对象化的Douglas-Peucker改进算法对面实体形状进行简化,然后将简化后的面实体所提取的节点以及基于面实体周长的均匀采样点作为面实体轮廓特征点.利用提取的轮廓特征点,采取一种极坐标方法对面实体进行形状描述,并分别计算出同名实体在节点和均匀采样点处的距离差异,将获取两者综合差异作为最终匹配标准.通过实验对比分析可知,该方法能有效解决复杂面状实体匹配速度和准确率问题.Aiming at the problem of the method of complex vector polygon matching,a named common boundary objected Douglas-Peucker improved algorithm is adopted to compress the polygon elements,then extracted feature points of elements profile which consist of the nodes of polygon and uniform sampling points based on the polygon perimeter.Polar coordinates is exploited to shape description through features points,and computed the distance difference of nodes and sampling points of elements,respectively,then obtained the comprehensive difference as the final matching standards.Experiments shows that the method effectively improved the matching speed and accuracy of the complex vector polygon elements.

关 键 词：矢量匹配 DOUGLAS-PEUCKER算法 极坐标 轮廓特征点 匹配距离 

分 类 号：P228.4[天文地球—大地测量学与测量工程]