Research Article
A Novel Method for Location Privacy Protection in LBS Applications
Algorithm 5
Generate the candidate of a queue.
| Input: Queue ; Delaunay triangulation ; Set of Candidate ; | |
| Output: set of Candidate ; | |
| 1. for each do | |
| 2. for each Simplex do | |
| 3. if then | |
| 4. l=t.vertices; | |
| 5. for each do | |
| 6. if then | |
| 7. Candy.add(v); | |
| 8. with ranking; | |
| 9. return ; |