A Novel Method for Location Privacy Protection in LBS Applications

Algorithm 4

Enumeration with the Voronoi diagram.

Input: real ranking ; Maximum tolerance

Output: ranking Set ;

1. init queue , set of Candidate ;

2. ; 3. for each do

4.  Generate Delaunay triangulation of

5. end for

6. function circulate():

7.  for each do

8.   q.add(item);

9.   if then

10.    ;

11.   else if then

12.    candy.remove(x) ;

13.   else

14.    q.add(item);

15.    calculate the candidate of ;

16.    circulate();

17. return ;