Quadtrees, Hypercube algorithms, Image processing
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. We assume that the architecture is SIMD, i.e., all PEs work under the control of a single control unit.
Shankar, Ravi V. and Ranka, Sanjay, "Hypercube Algorithms for Operations on Quadtrees" (1990). Electrical Engineering and Computer Science Technical Reports. Paper 83.