Quad Trees vs. k-D Trees

• k-D Trees

  • Density balanced trees
  • Number of nodes is O(n) where n is the number of points
  • Height of the tree is O(log n) with batch insertion
  • Supports insert, find, nearest neighbor, range queries

• Quad Trees

  • Number of nodes is O(n(1+ log(?/n))) where n is the number of points and ? is the ratio of the width (or height) of the key space and the smallest distance between two points
  • Height of the tree is O(log n + log ?)
  • Supports insert, delete, find, nearest neighbor, range queries

Previous slide

Next slide

Back to first slide

View graphic version