Module 4: Index Structures
  Lecture 16: Voronoi Diagrams and Tries
 

                                           

 

Algorithms
  • Used for 1-NN searches
  • Fortune's algorithm to construct Voronoi diagrams
 
  • Plane sweep
  • Time to construct is
  • Optimal
  • Requires space to store