Hypercube Algorithms for Operations on Quadtrees
R.V. Shankar, Sanjay Ranka · 2005
Abstract: This paper describes parallel algorithms for the following oper-ations on qua.dtrees- 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 architec-ture is SIMD, i.e., all PEs work under the control of a single control unit. [ ( eywords: Qua.dtrees, Hypercube algorithms, Image processing 1