Document Type

Report

Date

11-1990

Embargo Period

5-1-2012

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.

Additional Information

School of Computer and Information Science, Syracuse University, SU-CIS-90-34

Source

local

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.