| 面向交叉路口特征点的矢量数据化简算法 |
| |
| 引用本文： | 陈通,李世宝,刘建航,陈海华.面向交叉路口特征点的矢量数据化简算法[J].测绘科学,2018(2):58-62. |
| |
| 作者姓名： | 陈通 李世宝 刘建航 陈海华 |
| |
| 作者单位： |
|
| |
| 基金项目： | 山东省自然科学基金面上项目，青岛市科技创新计划项目，中央高校研究基金项目 |
| |
| 摘 要： | 针对现有的算法不能够很好地保留道路交叉路口特征点的问题,该文提出了一种基于道路交叉路口特征点的矢量数据化简算法。把曲线上的特征点分为交叉路口特征点和重要的特征点两类,对两类点分别进行处理得到分段点;利用相邻的分段点作为道格拉斯-普克算法的首尾点,对每段子曲线以基于最小二乘法拟合曲线选定最优距离阈值,进行逐段化简。实验结果表明,该算法能够有效地化简道路矢量数据并保留交叉路口和重要的特征点。
|
| 关 键 词： | 交叉路口特征点分段点最优阈值道格拉斯-普克算法化筒算法制图综合 |
A vector data reduction algorithm based on intersection feature points |
| |
| CHEN Tong,LI Shibao,LIU Jianhang,CHEN Haihua.A vector data reduction algorithm based on intersection feature points[J].Science of Surveying and Mapping,2018(2):58-62. |
| |
| Authors: | CHEN Tong LI Shibao LIU Jianhang CHEN Haihua |
| |
| Abstract: | Aiming at the problem that the existing algorithms cannot perfectly keep the intersection feature points,a vector-data-simplification algorithm based on feature points of the intersection was proposed.The feature points of curve were divided into intersection feature points and important feature points;these different points were separately processed to obtain segmentation points.Then,neighboring segmentation points were used as the starting and ending points of Douglas-Peucker algorithm.Finally,each segment of curves was simplified by optimal distance threshold segment by segment,which is the result of least square method fitting curve.Experimental results showed that this algorithm could effectively simplify road vector data and save the intersection points and important feature points. |
| |
| Keywords: | |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
