Document Type
Report
Date
11-1990
Keywords
Quadtrees, Hypercube algorithms, Image processing
Language
English
Disciplines
Computer Sciences
Description/Abstract
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.
Recommended Citation
Shankar, Ravi V. and Ranka, Sanjay, "Hypercube Algorithms for Operations on Quadtrees" (1990). Electrical Engineering and Computer Science - Technical Reports. 83.
https://surface.syr.edu/eecs_techreports/83
Source
local
Additional Information
School of Computer and Information Science, Syracuse University, SU-CIS-90-34