Shaffer, Clifford A.Samet, Hanan2013-06-192013-06-191988http://hdl.handle.net/10919/19412An algorithm is presented that performs set operations (e.g., union or intersection) on two unaligned images represented by linear quadtrees. This algorithm seeks to minimize the number of nodes that must be searched for or inserted into the disk-based node lists that represent the trees. Windowing and matching operations can also be cast as unaligned set functions; these operations can then be solved by similar algorithms.application/pdfenIn CopyrightTechnical reportTR-88-31http://eprints.cs.vt.edu/archive/00000116/01/TR-88-31.pdf