The quad-tree is the two-dimensional equivalent of the oct-tree. The space containing the geometry is recursively decomposed into sub-spaces respectively. As with the oct-tree the recursion stops if one of several possible terminal situations occurs.
2003-03-27