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.

Fig. 3.18 depicts a triangulated rectangular area and the resulting leaf structure when the triangles are inserted into the tree.

2003-03-27