Parallel algorithms for geometric connected component labeling on a hypercube multiprocessor

Parallel algorithms for the geometric connected component labeling (GCCL) problem on a hypercube multiprocessor can be designed by dividing the domain, consisting of a number of rectangles, into regions using a slice or rectangular partitioning scheme. Each processor in the hypercube is assigned one...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on computers Vol. 41; no. 6; pp. 699 - 709
Main Authors Belkhale, K.P., Banerjee, P.
Format Journal Article
LanguageEnglish
Published Legacy CDMS IEEE 01.06.1992
Institute of Electrical and Electronics Engineers
Subjects
Online AccessGet full text

Cover

Loading…