PARALLEL PROCESSING FOR QUADTREE PROBLEMS.

Gee Gwo Mei, Wentai Liu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

Abstract

Parallel architectures, based on the two-dimensional shuffle exchange (2DSE) network, to solve a class of quadtree problems are presented. Quadtree problems are those can be solved by using the quadtree as a data structure. The 2DSE approach allows the use of a spectrum of functionally equivalent configurations that have different number of processors and different time complexities. The various configurations provide more choices for obtaining the bestfit to the constraints of real-world applications. Results are given that include many primitive operations of computer vision.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Parallel Processing
EditorsKai Hwang, Steven M. Jacobs, Earl E. Swartzlander
PublisherIEEE
Pages452-454
Number of pages3
ISBN (Print)0818607246
Publication statusPublished - 1986

Publication series

NameProceedings of the International Conference on Parallel Processing
ISSN (Print)0190-3918

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Fingerprint

Dive into the research topics of 'PARALLEL PROCESSING FOR QUADTREE PROBLEMS.'. Together they form a unique fingerprint.

Cite this