地图匹配的新算法

New Algorithms for Map-Matching

提出地图匹配的两种新算法.一种算法是不断判断相邻测量点连线与道路l是否相交,另一种算法是先求部分测量点的凸壳CH,然后判断道路l与CH是否相交或CH是否包含l.这两种算法与传统方法完全不同,是采用计算几何中的方法设计的(非数值计算),具有算法简单、不需要数据融合、极少需要行车方向等优点.

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.