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.