Algorithm 1 Preliminary Matching Algorithm
Input:	Trajectory P1 → P2 … → Pn; OSM road network R
Output:	HCTPlist; Candidate matched points list $c_i^1$, $c_i^2$ … $c_i^j$
1:	Initialize HCTPlist and CanditateList as empty list;
2:	fori = 1 to n do
3:	C = GetCandidate (Pi, R, r); //get the candidates within radius r
4:	for j = 1 to C.count do
5:	${\theta }_i^j$ = |azi_Pi-azi_$c_i^j$|;
6:	if ${\theta }_i^j$ < $T_{\theta }$ then
7:	CandidatedList.add ($c_i^j$);
8:	end if
9:	end for
10:	if CandidateList.count == 1 then
11:	HCTPlist.add (Pi);
12:	end if
13:	end for