Hypercube algorithms for operations on quadtrees

摘要

This paper describes parallel algorithms for the following operations on quadtrees—boolean operations (union, intersection, complement), collapsing a quadtree, and neighbor finding in an image represented by a quadtree. The architecture assumed in this paper is a hypercube with one processing element (PE) per hypercube node. It is assumed that the architecture is SIMD, i.e. all PEs work under the control of a single control unit.