Operations on quadtree leaves and related image areas

The leaves of a quadtree can be specified by their colour, size, and position in one 32-bit word of data. Considerable advantages accrue for the manipulation of images if the restriction that the images be tiled by their quadtree leaves is relaxed so that any non-overlapping square areas are permissible; the code for such a set of squares of arbitrary size and registration we term squarecode. Algorithms are described for intercode conversion and for some basic geometrical manipulations of images. 1