| 地图匹配的新算法 |
| |
| 引用本文： | 周培德,付梦印. 地图匹配的新算法[J]. 北京理工大学学报, 2004, 24(3): 238-240 |
| |
| 作者姓名： | 周培德 付梦印 |
| |
| 作者单位： | 北京理工大学,信息科学技术学院计算机科学工程系,北京,100081;北京理工大学,信息科学技术学院自动控制系,北京,100081 |
| |
| 摘 要： | 提出地图匹配的两种新算法.一种算法是不断判断相邻测量点连线与道路l是否相交,另一种算法是先求部分测量点的凸壳CH,然后判断道路l与CH是否相交或CH是否包含l.这两种算法与传统方法完全不同,是采用计算几何中的方法设计的(非数值计算),具有算法简单、不需要数据融合、极少需要行车方向等优点.
|
| 关 键 词： | 车辆定位 地图匹配算法 时间复杂性 计算几何 |
| 文章编号： | 1001-0645(2004)03-0238-04 |
| 收稿时间： | 2003-04-16 |
New Algorithms for Map-Matching |
| |
| ZHOU Pei-de and FU Meng-yin. New Algorithms for Map-Matching[J]. Journal of Beijing Institute of Technology(Natural Science Edition), 2004, 24(3): 238-240 |
| |
| Authors: | ZHOU Pei-de and FU Meng-yin |
| |
| Affiliation: | ZHOU Pei-de~1,FU Meng-yin~2 |
| |
| Abstract: | Two algorithms are presented for map-matching, the one judges continuously whether connecting lines of adjacent measuring points intersect the route l , while the other computes the convex hull CH of some measuring points, and then judges whether the route l intersects CH or whether CH includes l . Both algorithms are designed using methods (no-numerical calculation) in computational geometry, and are entirely different from traditional means. They possess advantages in being independent of data fusion and little drive-direction and need shorter computation time. |
| |
| Keywords: | vehicle location map-matching algorithm time complexity computational geometry |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《北京理工大学学报》浏览原始摘要信息 |
|
点击此处可从《北京理工大学学报》下载全文 |
