Uses recursive decomposition to divide a grid
into a hierarchy of quadrants. (Figure 7.6).
A quadrant having cells with the same value
will not be sub-divided, and it is stored as a
leaf node.
Leaf nodes are coded with the value
homogeneous quadrant.
A quadrant having different cell values will be
subdivided until a quadrant at the finer level
contains only one value.