Quadtrees
  • is a tree data structure in which each internal node has exactly four children
  • are most often used to partition a two-dimensional space
  • quadtrees are the two-dimensional analog of octrees