Set Operations for Unaligned Linear Quadtrees

Files

TR Number

TR-88-31

Date

1988

Journal Title

Journal ISSN

Volume Title

Publisher

Department of Computer Science, Virginia Polytechnic Institute & State University

Abstract

An 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.

Description

Keywords

Citation