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

                                           

 

Extensions
  • or Mahalanobis distance may be used instead of
 
  • No guarantee that such a structure exists
  • Weighted may be used
  • In dimensions, requires space
  • Voronoi diagram of order-
 
  • Partition according to closest sites
 
  • Useful for -NN searches
 
  • Ordinary Voronoi is order-1
 
  • Order-() is called farthest point Voronoi diagram
 
  • In two dimensions, requires space and time